85 search results - page 5 / 17 » A DC Programming Approach for Sparse Eigenvalue Problem |
NIPS
2003
15 years 29 days ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
MIC
2003
15 years 29 days ago
2003
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method re...
ICASSP
2010
IEEE
14 years 11 months ago
2010
IEEE
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
109
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
This paper presents a general multi-view feature extraction approach that we call Generalized Multiview Analysis or GMA. GMA has all the desirable properties required for cross-vi...
96
Voted
JMLR
2006
2006
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
14 years 11 months ago
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...