10.8k citations
- SupélecFR13 papers
- Alcatel-Lucent (France)FR8 papers
- Princeton UniversityUS7 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Polytechnique MontréalCA5 papers
- Linköping UniversitySE4 papers
- University of Southern CaliforniaUS4 papers
- Queen's UniversityCA3 papers
- University of MiamiUS3 papers
- Weizmann Institute of ScienceIL3 papers
- California Southern UniversityUS2 papers
- École Polytechnique Fédérale de LausanneCH2 papers
4 papers · 1 filter
Average Size of a Suffix Tree for Markov Sources
Philippe Jacquet, Wojciech Szpankowski
We study a suffix tree built from a sequence generated by a Markovian source. Such sources are more realistic probabilistic models for text generation, data compression, molecular…
Fast ranking algorithm for very large data
Dohy Hong
In this paper, we propose a new ranking method inspired from previous results on the diffusion approach to solve linear equation. We describe new mathematical equations correspondi…
iBGP and Constrained Connectivity
Michael Dinitz, Gordon Wilfong
We initiate the theoretical study of the problem of minimizing the size of an iBGP overlay in an Autonomous System (AS) in the Internet subject to a natural notion of correctness d…
CR-precis: A deterministic summary structure for update data streams
Sumit Ganguly, Anirban Majumder
We present the \crprecis structure, that is a general-purpose, deterministic and sub-linear data structure for summarizing \emph{update} data streams. The \crprecis structure yield…