Sciweavers

187 search results - page 22 / 38
» Constrained 1-Spectral Clustering
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 9 days ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ICCV
2007
IEEE
16 years 1 months ago
Hierarchical Semantics of Objects (hSOs)
A successful representation of objects in the literature is as a collection of patches, or parts, with a certain appearance and position. The relative locations of the different p...
Devi Parikh, Tsuhan Chen
ICML
2008
IEEE
16 years 15 days ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
15 years 6 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
CVPR
2007
IEEE
15 years 6 months ago
Unsupervised Learning of Hierarchical Semantics of Objects (hSOs)
A successful representation of objects in the literature is as a collection of patches, or parts, with a certain appearance and position. The relative locations of the different p...
Devi Parikh, Tsuhan Chen