Abstract: The problem of robust matrix completion—the recovery of a low-rank matrix and a sparse matrix from a sampling of their superposition—has been addressed extensively in prior literature. Yet, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results