70 search results - page 7 / 14 » Fast computation of low rank matrix |
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
IPM
2008
13 years 8 months ago
2008
A fast and efficient page ranking mechanism for web crawling and retrieval remains as a challenging issue. Recently, several link based ranking algorithms like PageRank, HITS and ...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
In this paper, we propose a rank minimization method to fuse the predicted confidence scores of multiple models, each of which is obtained based on a certain kind of feature. Spe...