76 search results - page 1 / 16 » On the Complexity of Matrix Rank and Rigidity |
CSR
2007
Springer
13 years 11 months ago
2007
Springer
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
IVC
2007
13 years 4 months ago
2007
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
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...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
The rigidity of a matrix A for target rank r is the minimum number of entries of A that
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
Non-rigid structure from motion (NR-SFM) is a difficult, underconstrained problem in computer vision. This paper proposes a new algorithm that revises the standard matrix factori...