1389 search results - page 96 / 278 » Improved Approximation Algorithms for Label Cover Problems |
130
Voted
SIGIR
2010
ACM
15 years 3 months ago
2010
ACM
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
124
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
137
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
107
click to vote
JCO
2006
15 years 3 months ago
2006
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
126
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...