Sciweavers

CORR
2008
Springer
151views Education» more  CORR 2008»
14 years 9 months ago
Exact Matrix Completion via Convex Optimization
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at ran...
Emmanuel J. Candès, Benjamin Recht
FSTTCS
2008
Springer
14 years 10 months ago
Dynamic matrix rank with partial lookahead
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...
Telikepalli Kavitha