103 search results - page 11 / 21 » Consistency and Random Constraint Satisfaction Models |
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
ICDT
2010
ACM
15 years 1 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
SARA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
CVPR
2012
IEEE
12 years 12 months ago
2012
IEEE
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
110
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...