2084 search results - page 186 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
113
Voted
TPDS
2008
15 years 2 months ago
2008
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
120
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
105
Voted
HIPC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We consider the problem of redistributing data on homogeneous and heterogeneous processor rings. The problem arises in several applications, each time after a load-balanc...
156
Voted
DIS
2009
Springer
15 years 9 months ago
2009
Springer
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
129
Voted
TWC
2008
15 years 2 months ago
2008
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...