1142 search results - page 98 / 229 » Approximability of Clausal Constraints |
161
click to vote
NIPS
2007
15 years 7 months ago
2007
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...
165
click to vote
COMPUTING
2004
15 years 6 months ago
2004
In this paper a method for multiresolution deformation of planar piecewise linear curves that preserves the curve length is presented. In a wavelet based multiresolution editing f...
164
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
158
click to vote
RSCTC
2004
Springer
15 years 11 months ago
2004
Springer
We study properties of infomorphisms between information systems. In particular, we interpret infomorphisms between information systems in terms of sums with constraints (constrain...
185
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...