5115 search results - page 706 / 1023 » On Randomized Lanczos Algorithms |
174
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
176
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
144
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
175
click to vote
CVPR
2010
IEEE
16 years 6 days ago
2010
IEEE
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
171
click to vote
APPROX
2005
Springer
16 years 3 days ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...