Sciweavers

363 search results - page 2 / 73
» Decomposition of the NVALUE constraint
Sort
View
JCSS
2008
107views more  JCSS 2008»
14 years 9 months ago
A unified theory of structural tractability for constraint satisfaction problems
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
David A. Cohen, Peter Jeavons, Marc Gyssens
KDD
2012
ACM
183views Data Mining» more  KDD 2012»
13 years 4 hour ago
Mining discriminative components with low-rank and sparsity constraints for face recognition
This paper introduces a novel image decomposition approach for an ensemble of correlated images, using low-rank and sparsity constraints. Each image is decomposed as a combination...
Qiang Zhang, Baoxin Li
CORR
2011
Springer
207views Education» more  CORR 2011»
14 years 4 months ago
The AllDifferent Constraint with Precedences
We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We ident...
Christian Bessiere, Nina Narodytska, Claude-Guy Qu...
EMNLP
2011
13 years 9 months ago
Dual Decomposition with Many Overlapping Components
Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are ...
André L. Martins, Noah A. Smith, Már...