5115 search results - page 66 / 1023 » On Randomized Lanczos Algorithms |
STOC
2002
ACM
16 years 3 days ago
2002
ACM
STOC
2002
ACM
16 years 3 days ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
STOC
2003
ACM
16 years 3 days ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
105
click to vote
ALGORITHMICA
2010
14 years 12 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Abstract. Starting with a monodisperse configuration with n size