6251 search results - page 234 / 1251 » Randomness, Computability, and Density |
134
click to vote
PPL
2000
15 years 4 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
136
Voted
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
137
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
130
click to vote
UC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We investigate methods for exploiting nondeterminism inherent within the Tile Assembly Model in order to generate uniform random numbers. Namely, given an integer range {...
121
click to vote
ICPP
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we propose a priority-based balanced routing scheme, called the priority STAR routing scheme, which leads to optimal throughput and average delay at the same time f...