848 search results - page 30 / 170 » Randomness and the linear degrees of computability |
110
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
90
Voted
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
141
click to vote
ICDCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
145
Voted
CRYPTO
2001
Springer
15 years 8 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
154
Voted
SBRN
2008
IEEE
15 years 10 months ago
2008
IEEE
The design of an autonomous navigation system for mobile robots can be a tough task. Noisy sensors, unstructured environments and unpredictability are among the problems which mus...