1717 search results - page 223 / 344 » A Computable Spectral Theorem |
188
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Bottom-up, fully unsupervised segmentation remains a daunting challenge for computer vision. In the cosegmentation context, on the other hand, the availability of multiple images ...
206
click to vote
ERSHOV
2009
Springer
15 years 9 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
144
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
150
click to vote
CVPR
2009
IEEE
17 years 19 days ago
2009
IEEE
We propose a method based on sparse representation
(SR) to cluster data drawn from multiple low-dimensional
linear or affine subspaces embedded in a high-dimensional
space. Our ...
187
click to vote
CVPR
2009
IEEE
17 years 19 days ago
2009
IEEE
Latent Variable Models (LVM), like the Shared-GPLVM
and the Spectral Latent Variable Model, help mitigate over-
fitting when learning discriminative methods from small or
modera...