1142 search results - page 31 / 229 » Approximability of Clausal Constraints |
APPROX
2005
Springer
15 years 7 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
121
click to vote
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
118
click to vote
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this work we present a model that uses a Dirichlet Process (DP) with a dynamic spatial constraints to approximate a non-homogeneous hidden Markov model (NHMM). The coefficient ...
149
click to vote
ISBI
2004
IEEE
16 years 2 months ago
2004
IEEE
We present a new fast implementation of a non-rigid registration algorithm, based on a finite element elastic deformation model using the mutual information metric with a linear e...
109
click to vote
PAMI
2006
15 years 1 months ago
2006
This study investigates a level set method for complex polarimetric image segmentation. It consists of minimizing a functional containing an original observation term derived from ...