338 search results - page 16 / 68 » Fast distributed random walks |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Random projection methods give distributions over k
HICSS
2006
IEEE
15 years 3 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
107
click to vote
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
FOCS
2009
IEEE
15 years 4 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...
87
Voted
CCGRID
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...