5115 search results - page 89 / 1023 » On Randomized Lanczos Algorithms |
WWW
2004
ACM
16 years 16 days ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
CP
2004
Springer
15 years 5 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...
103
click to vote
CPC
2007
14 years 12 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
STOC
1992
ACM
15 years 3 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...