338 search results - page 4 / 68 » Fast distributed random walks |
CORR
2012
Springer
13 years 5 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
WSC
2000
14 years 11 months ago
2000
This paper deals with estimating small tail probabilities of the steady-state waiting time in a GI/GI/1 queue with heavy-tailed (subexponential) service times. The problem of esti...
81
Voted
STOC
2002
ACM
15 years 10 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...