Sciweavers

6358 search results - page 34 / 1272
» Computing spectral sequences
Sort
View
DAGSTUHL
2006
14 years 11 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
CVPR
2007
IEEE
15 years 11 months ago
Spectral Matting
We present spectral matting: a new approach to natural image matting that automatically computes a set of fundamental fuzzy matting components from the smallest eigenvectors of a ...
Anat Levin, Alex Rav-Acha, Dani Lischinski
FOCS
2000
IEEE
15 years 2 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
CVPR
2009
IEEE
1133views Computer Vision» more  CVPR 2009»
16 years 4 months ago
Sparse Subspace Clustering
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 ...
Ehsan Elhamifar, René Vidal
ICCV
2009
IEEE
16 years 2 months ago
Non-Negative Matrix Factorization of Partial Track Data for Motion Segmentation
This paper addresses the problem of segmenting lowlevel partial feature point tracks belonging to multiple motions. We show that the local velocity vectors at each instant of th...
Anil M. Cheriyadat and Richard J. Radke