387 search results - page 14 / 78 » Many Random Walks Are Faster Than One |
CP
2004
Springer
14 years 2 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
This paper proposes to extend a previous work, The Effect of the Back Button in a Random Walk: Application for PageRank [5]. We introduce an enhanced version of the PageRank algor...
ALENEX
2007
13 years 10 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
IMC
2010
ACM
13 years 7 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
TOMACS
2002
13 years 8 months ago
2002
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...