5595 search results - page 922 / 1119 » Approximation Algorithms for Clustering Problems |
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
179
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
152
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
275
Voted
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
181
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...