358 search results - page 32 / 72 » Rank Matrix Factorisation |
STOC
2009
ACM
15 years 11 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
SMILE
1998
Springer
15 years 3 months ago
1998
Springer
We revisit the bilinear matching constraint between two perspective views of a 3D scene. Our objective is to represent the constraint in the same manner and form as the trilinear ...
IEICET
2007
14 years 10 months ago
2007
From the appearance of CodeRed and SQL Slammer worm, we have learned that the early detection of worm epidemics is important to reduce the damage caused by their outbreak. One prom...
SLSFS
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...
DAGSTUHL
2007
15 years 9 days ago
2007
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal sc...