611 search results - page 45 / 123 » The Cardinality Matrix Constraint |
CP
2005
Springer
15 years 3 months ago
2005
Springer
In the context of previous work on redundant modeling, permutation problems and matrix modeling, we introduce the notion of partial redundant modeling and categorical channeling co...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
ICPR
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
119
click to vote
FROCOS
2009
Springer
15 years 4 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...