Sciweavers

Share
338 search results - page 1 / 68
» Fast distributed random walks
Sort
View
PODC
2009
ACM
11 years 4 months ago
Fast distributed random walks
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...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
10 years 8 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
CORR
2011
Springer
184views Education» more  CORR 2011»
9 years 11 months ago
Stationary distribution and cover time of random walks on random digraphs
We study properties of a simple random walk on the random digraph Dn,p when
Colin Cooper, Alan M. Frieze
ADHOCNOW
2010
Springer
10 years 5 months ago
Coverage-Adaptive Random Walks for Fast Sensory Data Collection
Random walks in wireless sensor networks can serve as fully local, very simple strategies for sink motion that reduce energy dissipation a lot but increase the latency of data coll...
Constantinos Marios Angelopoulos, Sotiris E. Nikol...
UAI
2003
10 years 5 months ago
Markov Random Walk Representations with Continuous Distributions
We propose a framework to extend Markov random walks (Szummer and Jaakkola, 2001) to a continuum of points. In this framework, the transition probability between two points is the...
Chen-Hsiang Yeang, Martin Szummer
books