611 search results - page 20 / 123 » The Cardinality Matrix Constraint |
AAAI
2004
14 years 11 months ago
2004
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
102
click to vote
IAT
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper proposes a method of learning a similarity matrix from pairwise constraints for interactive clustering. The similarity matrix can be learned by solving an optimizatio...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
The fundamental matrix is a central construct in the analysis of images captured from a pair of cameras and many feature-based methods have been proposed for its computation. In t...
108
click to vote
ICASSP
2009
IEEE
14 years 7 months ago
2009
IEEE
Nonnegative matrix factorization (NMF) is a widely-used method for low-rank approximation (LRA) of a nonnegative matrix (matrix with only nonnegative entries), where nonnegativity...