1068 search results - page 29 / 214 » Factorization as a Rank 1 Problem |
JMLR
2012
13 years 5 days ago
2012
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
ASIACRYPT
2007
Springer
15 years 3 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...
115
click to vote
SDM
2012
SIAM
13 years 3 days ago
2012
SIAM
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...