3894 search results - page 629 / 779 » Approximation Algorithms for Biclustering Problems |
114
Voted
CORR
2010
Springer
15 years 3 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...
134
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
146
Voted
SODA
2008
ACM
15 years 5 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...
115
click to vote
STOC
2001
ACM
16 years 3 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...
235
Voted
VLDB
2007
ACM
16 years 3 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...