764 search results - page 41 / 153 » Maximum-Margin Matrix Factorization |
201
click to vote
NIPS
2004
15 years 8 months ago
2004
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
168
click to vote
APPML
2007
15 years 7 months ago
2007
We consider the computation of the Iwasawa decomposition of a symplectic matrix via the QR factorization. The algorithms presented improve on the method recently decribed in [8]. K...
209
click to vote
ICFCA
2009
Springer
16 years 1 months ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
214
click to vote
NIPS
2003
15 years 8 months ago
2003
The problem of “Structure From Motion” is a central problem in vision: given the 2D locations of certain points we wish to recover the camera motion and the 3D coordinates of ...
207
click to vote
PDP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper examines the scalable parallel implementation of QR factorization of a general matrix, targeting SMP and multi-core architectures. Two implementations of algorithms-by-...