5153 search results - page 714 / 1031 » Introduction to Randomized Algorithms |
151
click to vote
STOC
2010
ACM
16 years 4 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 (...
189
click to vote
CVPR
2010
IEEE
16 years 13 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...
184
click to vote
APPROX
2005
Springer
16 years 11 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...
172
click to vote
WAOA
2005
Springer
16 years 8 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
176
click to vote
ICA
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...