Steve Chien, Cynthia Dwork, Ravi Kumar, D. Sivakumar  Home/Search
Context Related
| ibm.com/cs/people/siva/pa...linkevol.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ibm.com/cs/people/siva/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Exploiting hyperlink information has revolutionized search algorithms for the Web [8, 2]. As the Web grows, its link structure, along with content, evolves at a rapid rate. Consequently, large-scale static hyperlink-based ranking computations become too expensive to be performed frequently. (Update)
Similar documents based on text: More All
0.8: PageRank: A Circuital Analysis - Bianchini, Gori, Scarselli (2002) (Correct)
0.7: Efficient Computation of PageRank - Haveliwala (1999) (Correct)
0.7: Topic-Sensitive PageRank - Haveliwala (2002) (Correct)
Related documents from co-citation: More All
8: The PageRank citation ranking: Bringing order to the Web - Page, Brin et al.
7: The anatomy of a large-scale hypertextual Web search engine - Brin, Page
7: Topic-sensitive PageRank - Haveliwala - 2002
BibTeX entry: (Update)
S. Chien, C. Dwork, S. Kumar, and D. Sivakumar. Towards exploiting link evolution. Unpublished manuscript, 2001. http://citeseer.ist.psu.edu/chien01towards.html More
@misc{ chien01towards,
author = "S. Chien and C. Dwork and S. Kumar and D. Sivakumar",
title = "Towards exploiting link evolution",
text = "S. Chien, C. Dwork, S. Kumar, and D. Sivakumar. Towards exploiting link
evolution. Unpublished manuscript, 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/chien01towards.html" }
Citations (may not include all citations):576 Authoritative source in a hyperlinked environment - Kleinberg - 1999
140 Graph structure in the Web (context) - Broder, Maghoul et al. - 2000
64 extensible Web crawler (context) - Heydon, Najork et al. - 1999
32 Automating the construction of Internet portals with machine.. - McCallum, Nigam et al. - 2000
31 Finding authorities and hubs from link structures on the Wor.. - Borodin, Roberts et al. - 2001
27 Self-similarity in the Web - Dill, Kumar et al. - 2001
27 Stable algorithms for link analysis - Ng, Zheng et al. - 2001
15 The role of the group generalized inverse in the theory of f.. (context) - Meyer - 1975
15 The link database: Fast access to graphs of the Web - Randall, Stata et al. - 2001
11 The anatomy of a large-scale hypertextual (context) - Brin, Page - 1998
7 Markov chain sensitivity measured by mean first passage time.. - Cho, Meyer - 2000
5 Comparison of perturbation bounds for the stationary distrib.. - Cho, Meyer - 2001
1 th International Joint Conference on Artificial Intelligence (context) - Ng, Zheng et al. - 2001
1 astic models for the Web graph. Proc. 41st IEEE Symposium on.. (context) - Kumar, Raghavan et al. - 2000
Documents on the same site (http://www.almaden.ibm.com/cs/people/siva/papers.html): More
Roundness Estimation Via Random Sampling - Kumar, Sivakumar (1999) (Correct)
Proofs, Codes, and Polynomial-Time Reducibilities - Kumar, Sivakumar (Correct)
Constant Depth Circuits and the Lutz Hypothesis - Cai, Sivakumar, Strauss (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC