1612 search results - page 198 / 323 » Analysing Randomized Distributed Algorithms |
109
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Quantization is intrinsic to several data acquisition systems. This process is especially important in distributed settings, where observations must rst be compressed before they ...
124
Voted
OPODIS
2010
15 years 11 days ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
123
click to vote
STOC
1993
ACM
15 years 6 months ago
1993
ACM
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
159
Voted
WWW
2011
ACM
14 years 9 months ago
2011
ACM
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
156
click to vote
SIAMCOMP
2002
15 years 2 months ago
2002
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 ...