Sciweavers

5115 search results - page 68 / 1023
» On Randomized Lanczos Algorithms
Sort
View
CSC
2009
15 years 28 days ago
Improving Random Walk Performance
Random walk simulation is employed in many experimental algorithmic applications. Efficient execution on modern computer architectures demands that the random walk be implemented t...
Ilya Safro, Paul D. Hovland, Jaewook Shin, Michell...
WAW
2007
Springer
105views Algorithms» more  WAW 2007»
15 years 6 months ago
Deterministic Decentralized Search in Random Graphs
Esteban Arcaute, Ning Chen, Ravi Kumar, David Libe...
STOC
1993
ACM
103views Algorithms» more  STOC 1993»
15 years 3 months ago
Efficient learning of typical finite automata from random walks
Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt R...
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
15 years 1 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
SPAA
2010
ACM
15 years 4 months ago
Multi-sided shared coins and randomized set-agreement
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...
Keren Censor Hillel