719 search results - page 44 / 144 » Solving Sparse Linear Constraints |
107
click to vote
IAT
2009
IEEE
15 years 5 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...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
CAV
2008
Springer
15 years 19 days ago
2008
Springer
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...
ICIP
2010
IEEE
14 years 8 months ago
2010
IEEE
Sets of multi-view images that capture plenoptic information from different viewpoints are typically related by geometric constraints. The proper analysis of these constraints is ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...