2698 search results - page 214 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
198
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
193
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
167
click to vote
IPL
2008
15 years 6 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
181
click to vote
JMLR
2012
13 years 9 months ago
2012
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
173
click to vote
SSDBM
2003
IEEE
15 years 11 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...