Sciweavers

155 search results - page 5 / 31
» Fast matrix rank algorithms and applications
Sort
View
WWW
2003
ACM
15 years 10 months ago
Extrapolation methods for accelerating PageRank computations
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
Sepandar D. Kamvar, Taher H. Haveliwala, Christoph...
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 4 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
73
Voted
DAGSTUHL
2007
14 years 11 months ago
The Sinkhorn-Knopp Algorithm: Convergence and Applications
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...
Philip A. Knight
SLSFS
2005
Springer
15 years 3 months ago
Incorporating Constraints and Prior Knowledge into Factorization Algorithms - An Application to 3D Recovery
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...
Amit Gruber, Yair Weiss
CVPR
2005
IEEE
15 years 11 months ago
Rank-R Approximation of Tensors: Using Image-as-Matrix Representation
We present a novel multilinear algebra based approach for reduced dimensionality representation of image ensembles. We treat an image as a matrix, instead of a vector as in tradit...
Hongcheng Wang, Narendra Ahuja