37 search results - page 6 / 8 » Matrix completion from a few entries |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
JCB
2007
13 years 7 months ago
2007
Many bioinformatics problems can implicitly depend on estimating large-scale covariance matrix. The traditional approaches tend to give rise to high variance and low accuracy esti...
COMBINATORICS
2007
13 years 7 months ago
2007
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partia...
JMLR
2010
13 years 2 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...