Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)

14 years 10 months ago

Download www.di.unipi.it

ystem (Extended Abstract) Gianna M. Del Corso1 Antonio Gull´ı1,2 Francesco Romani1 1 Dipartimento di Informatica, University of Pisa, Italy 2 IIT-CNR, Pisa

Gianna M. Del Corso, Antonio Gulli, Francesco Roma

Real-time Traffic

2 Francesco | Algorithms | Antonio Gull´ı1 | University Of Pisa | WAW 2004 |

claim paper

» Parallel Sparse Matrix Computations Using the PINEAPL Library A Performance Study

» Exact and Approximate Sparse Solutions of Underdetermined Linear Equations

» Fast linearized energy allocation for multimedia loading on multicarrier systems

» Fast Structured Newton Computations

» Fast vectorless power grid verification using an approximate inverse technique

» VNETP bridging the cloud and high performance computing through fast overlay networking

» Solving Linear Systems through Nested Dissection

» Parametric model order reduction accelerated by subspace recycling

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	WAW
Authors	Gianna M. Del Corso, Antonio Gulli, Francesco Romani

Comments (0)

Sciweavers

Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)

2 Francesco | Algorithms | Antonio Gull´ı1 | University Of Pisa | WAW 2004 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers