49 search results - page 3 / 10 » Generalized low rank approximations of matrices |
SIAMJO
2011
13 years 1 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
APPROX
2006
Springer
13 years 10 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
MOR
2008
13 years 6 months ago
2008
We consider the problem of finding a low
COLT
2005
Springer
13 years 11 months ago
2005
Springer
We study the rank, trace-norm and max-norm as complexity measures of matrices, focusing on the problem of fitting a matrix with matrices having low complexity. We present generali...
DAGSTUHL
2007
13 years 7 months ago
2007
We outline an approach for re-interpreting methods for ranking web pages based on interesting recent work on matrix power series representations for PageRank and its variants, such...