477 search results - page 63 / 96 » Algorithms for Non-negative Matrix Factorization |
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper presents a new sparse representation for acoustic signals which is based on a mixing model defined in the complex-spectrum domain (where additivity holds), and allows ...
AAAI
2012
13 years 2 days ago
2012
To solve the sparsity problem in collaborative filtering, researchers have introduced transfer learning as a viable approach to make use of auxiliary data. Most previous transfer...
PPL
2002
14 years 9 months ago
2002
We present new communication-efficient parallel dense linear solvers: a solver for triangular linear systems with multiple right-hand sides and an LU factorization algorithm. Thes...
189
click to vote
ASPLOS
2009
ACM
15 years 10 months ago
2009
ACM
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...