6393 search results - page 963 / 1279 » Randomized Algorithms on the Mesh |
146
click to vote
CVPR
2010
IEEE
15 years 10 months 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...
143
click to vote
APPROX
2005
Springer
15 years 10 months 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...
134
click to vote
WAOA
2005
Springer
15 years 10 months 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...
139
click to vote
ICA
2004
Springer
15 years 10 months 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...
158
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...