Sciweavers

380 search results - page 10 / 76
» Mapping Problems with Finite-Domain Variables into Problems ...
Sort
View
FCS
2007
13 years 9 months ago
The Complexity of Futile Questioning
Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified ...
Anja Remshagen, Klaus Truemper
AIME
2009
Springer
13 years 11 months ago
Data-Efficient Information-Theoretic Test Selection
We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimate...
Marianne Mueller, Rómer Rosales, Harald Ste...
CVPR
2009
IEEE
15 years 2 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...
CP
2007
Springer
14 years 1 months ago
Towards Robust CNF Encodings of Cardinality Constraints
Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are th...
João P. Marques Silva, Inês Lynce
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson