Sciweavers

280 search results - page 20 / 56
» Binary Matrix Factorization with Applications
Sort
View
96
Voted
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 7 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
15 years 7 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
CVPR
1999
IEEE
16 years 2 months ago
An Efficient Recursive Factorization Method for Determining Structure from Motion
A recursive method is presented for recovering 3D object shape and camera motion under orthography from an extended sequence of video images. This may be viewed as a natural exten...
Yanhua Li, Michael J. Brooks
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
14 years 10 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
83
Voted
SPAA
1998
ACM
15 years 4 months ago
Elimination Forest Guided 2D Sparse LU Factorization
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
Kai Shen, Xiangmin Jiao, Tao Yang