𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Adaptive methods for the computation of PageRank

✍ Scribed by Sepandar Kamvar; Taher Haveliwala; Gene Golub

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
316 KB
Volume
386
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Comparison of Krylov subspace methods on
Comparison of Krylov subspace methods on the PageRank problem
✍ Gianna M. Del Corso; Antonio GullΓ­; Francesco Romani πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 289 KB

PageRank algorithm plays a very important role in search engine technology and consists in the computation of the eigenvector corresponding to the eigenvalue one of a matrix whose size is now in the billions. The problem incorporates a parameter that determines the difficulty of the problem. In this

Adaptive vs. non-adaptive strategies for
Adaptive vs. non-adaptive strategies for the computation of optical flow
✍ J. V. Condell; B. W. Scotney; P. J. Morrow πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 772 KB

Confident adaptive algorithms are described, evaluated, and compared with other algorithms that implement the estimation of motion. A Galerkin finite element adaptive approach is described for computing optical flow, which uses an adaptive triangular mesh in which the resolution increases where moti

Vector extrapolation methods with applic
Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations
✍ Avram Sidi πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 859 KB

An important problem that arises in different areas of science and engineering is that of computing the limits of sequences of vectors {x n }, where x n ∈ C N with N very large. Such sequences arise, for example, in the solution of systems of linear or nonlinear equations by fixed-point iterative me