2996 search results - page 76 / 600 » Numberings and Randomness |
106
Voted
SPAA
2009
ACM
15 years 9 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
117
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
88
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
112
Voted
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
172
click to vote
JCO
2006
15 years 19 days ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...