3894 search results - page 73 / 779 » Approximation Algorithms for Biclustering Problems |
160
click to vote
SIGPRO
2011
15 years 1 months ago
2011
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
185
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
151
click to vote
SIAMCOMP
2010
15 years 27 days ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
171
click to vote
DEXA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
163
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...