155 search results - page 4 / 31 » Fast matrix rank algorithms and applications |
ICIP
1999
IEEE
15 years 11 months ago
1999
IEEE
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
109
click to vote
KDD
2012
ACM
13 years 1 days ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
123
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
109
click to vote
MP
2011
14 years 4 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...