9 search results - page 1 / 2 » The Mortality Problem for Matrices of Low Dimensions |
MST
2002
13 years 4 months ago
2002
In this paper we discuss the existence of an algorithm to decide if a given set of 2
ICML
2004
IEEE
14 years 5 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
Several authors have noticed that the common representation of images as vectors is sub-optimal. The process of vectorization eliminates spatial relations between some of the near...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm ma...