4 search results - page 1 / 1 » Uniqueness of Low-Rank Matrix Completion by Rigidity Theory |
SIAMMAX
2010
12 years 11 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We propose a new set of rotationally and translationally invariant features for image or pattern recognition and classification. The new features are cubic polynomials in the pix...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...