588 search results - page 103 / 118 » Computing the Dimension of Linear Subspaces |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
ACCV
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. In set-based face recognition, each set of face images is often represented as a linear/nonlinear manifold and the Principal Angles (PA) or Kernel PAs are exploited to me...
NIPS
1997
13 years 11 months ago
1997
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
FOCS
2004
IEEE
14 years 1 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
CVPR
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper we develop a theory for characterizing how deformable a shape is. We define a term called “deformability index” for shapes. The deformability index is computed ...