1381 search results - page 52 / 277 » Computational Complexity of Constraint Satisfaction |
143
click to vote
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
170
click to vote
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
We propose a method for estimating the pose of a human body using its approximate 3D volume (visual hull) obtained in real time from synchronized videos. Our method can cope with ...
141
click to vote
IJCAI
2003
15 years 5 months ago
2003
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
129
click to vote
JAPLL
2010
15 years 2 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
146
click to vote
COCO
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...