5115 search results - page 9 / 1023 » On Randomized Lanczos Algorithms |
RANDOM
1999
Springer
13 years 11 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
VOSS
2004
Springer
14 years 1 days ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
ALT
2007
Springer
14 years 3 months ago
2007
Springer
It has been recently shown that calibration with an error less than ∆ > 0 is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are obtained by...
STOC
2010
ACM
14 years 4 months ago
2010
ACM