266 search results - page 2 / 54 » High-Rank Matrix Completion |
CORR
2008
Springer
13 years 5 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...
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
CORR
2011
Springer
13 years 9 days ago
2011
Springer
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...
CORR
2011
Springer
13 years 9 days ago
2011
Springer
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries o...