477 search results - page 39 / 96 » Algorithms for Non-negative Matrix Factorization |
MOC
2000
13 years 7 months ago
2000
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often observed robustness. By using a tridiagonal structure...
IDA
2008
Springer
13 years 7 months ago
2008
Springer
A principally new approach to the classifications of nucleotide sequences based on the "natural" classification concept is proposed. As a result of "natural" c...
CVPR
2011
IEEE
13 years 4 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...
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
CVPR
2010
IEEE
13 years 5 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...