3341 search results - page 235 / 669 » On Bounded Queries and Approximation |
204
click to vote
TKDE
2011
15 years 1 months ago
2011
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
161
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract--This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative ...
178
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
168
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
171
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...