5115 search results - page 94 / 1023 » On Randomized Lanczos Algorithms |
100
click to vote
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
109
Voted
WWW
2006
ACM
16 years 16 days ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
PODC
2010
ACM
15 years 3 months ago
2010
ACM
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
101
click to vote
SPAA
2010
ACM
15 years 2 days ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
WSC
2008
15 years 2 months ago
2008
Simulations often depend heavily on random numbers, yet the impact of random number generators is recognized seldom. The generation of random numbers for simulations is not trivia...