Sciweavers

104 search results - page 8 / 21
» Limit distribution of degrees in random family trees
Sort
View
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
13 years 7 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger
PODC
2004
ACM
14 years 25 days ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
14 years 26 days ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...
TIT
2010
144views Education» more  TIT 2010»
13 years 2 months ago
Lossy source compression using low-density generator matrix codes: analysis and algorithms
We study the use of low-density generator matrix (LDGM) codes for lossy compression of the Bernoulli symmetric source. First, we establish rigorous upper bounds on the average dist...
Martin J. Wainwright, Elitza N. Maneva, Emin Marti...
ICASSP
2011
IEEE
12 years 11 months ago
Random block-angular matrices for distributed data storage
Random binary matrices have found many applications in signal processing and coding. Rateless codes, for example, are based on the random generation of codewords by means of inner...
Paulo Jorge S. G. Ferreira, Bruno Jesus, Jose Viei...