611 search results - page 25 / 123 » The Cardinality Matrix Constraint |
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
78
Voted
COMPULOG
1999
Springer
15 years 1 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
VL
2000
IEEE
15 years 2 months ago
2000
IEEE
SD2 is a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They augment the systems of Venn-Peirce ...
109
click to vote
MP
2011
14 years 4 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
74
Voted
IPL
2006
14 years 9 months ago
2006
We show that for a given set of m pairwise constraints over n variables, a variable assignment that satisfies maximally many m constraints (MAX-2-CSP) can be found in O(nm dn/3) t...