CORR
2008
Springer
13 years 4 months ago
2008
Springer
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...
FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
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)...