611 search results - page 27 / 123 » The Cardinality Matrix Constraint |
78
Voted
AAAI
2006
14 years 11 months ago
2006
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
IPCO
2008
14 years 11 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
IEE
1998
14 years 9 months ago
1998
In recent years a number of OO methods have been enhanced with textual, mathematical languages for specifying invariants and action contracts (pre and post conditions). This paper ...
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we present a novel algorithm for representing facial expressions. The algorithm is based on the non-negative matrix factorization (NMF) algorithm, which decomposes ...
ACL
2004
14 years 11 months ago
2004
Aligning words from sentences which are mutual translations is an important problem in different settings, such as bilingual terminology extraction, Machine Translation, or projec...