563 search results - page 9 / 113 » Computing approximate PSD factorizations |
131
Voted
AI
2011
Springer
14 years 7 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
105
Voted
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
CVPR
1999
IEEE
16 years 2 months ago
1999
IEEE
Tomasi and Kanade [1] introduced the factorization method for recovering 3D structure from 2D video. In their formulation, the 3D shape and 3D motion are computed by using an SVD ...
101
Voted
NIPS
2001
15 years 2 months ago
2001
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
87
Voted
SIAMSC
2008
15 years 22 days ago
2008
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...