S. Chien, C. Dwork, R. Kumar, D. Simon, and D. Sivakumar, Towards exploiting link evolution, Workshop on Algorithms for the Web, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Link Analysis Ranking Algorithms Theory And Experiments - Borodin, Roberts.. (2004) (Correct)
....does not contain a seed node, then the MAX algorithm will allocate zero weight to the nodes of that component. If chosen appropriately, the nodes in the component that receive zero weight violate the strict monotonicity property. # A different notion of monotonicity is considered by Chien et al. [12]. In their paper, they study how the weight of a node changes as new links are added to the node. In this setting an algorithm is monotone if the weight of a node increases as its in degree increases. 4.3 Distance measures between LAR vectors We are interested in comparing different LAR ....
S. Chien, C. Dwork, R. Kumar, D. Simon, and D. Sivakumar. Towards exploiting link evolution. In Workshop on Algorithms for the Web, Vancuver, 2002.
I/O-Efficient Techniques for Computing Pagerank - Chen, Gan, Suel (Correct)
....time per iteration. There are a number of other well known techniques [7, 41] from linear algebra that might improve convergence; note however that the potential improvement is limited given the modest number of iterations required even by the basic iterative process. Finally, recent work in [19] proposes to reduce the cost of computing Pagerank by incrementally recomputing values as the link structure evolves. 4. CONTRIBUTIONS OF THIS PAPER In this paper, we study techniques for the I O e#cient implementation of Pagerank in the case where the graph is too large to fit in main memory. ....
S. Chien, C. Dwork, S. Kumar, and D. Sivakumar. Towards exploiting link evolution. Unpublished manuscript, 2001.
An Analysis of Optimal Link Bombs - Sibel Adal Tina (Correct)
No context found.
S. Chien, C. Dwork, R. Kumar, D. Simon, and D. Sivakumar, Towards exploiting link evolution, Workshop on Algorithms for the Web, 2002.
An Analysis of Optimal Link Bombs - Sibel Adal Tina (Correct)
No context found.
S. Chien, C. Dwork, R. Kumar, D. Simon, and D. Sivakumar, Towards exploiting link evolution, Workshop on Algorithms for the Web, 2002.
Updating the Stationary Vector of an Irreducible Markov.. - Langville, Meyer (2004) (1 citation) (Correct)
No context found.
Steve Chien, Cynthia Dwork, Ravi Kumar, and D. Sivakumar. Towards exploiting link evolution. In Workshop on algorithms and models for the Web graph, 2001.
Ranking the Web Frontier - Eiron, McCurley, Tomlin (2004) (19 citations) (Correct)
No context found.
Steve Chien, Cynthia Dwork, Ravi Kumar, and D. Sivakumar. Towards exploiting link evolution. In Workshop on Algorithms and Models for the Web Graph, 2001.
Exploiting Web Matrix Permutations to Speedup PageRank.. - Corso, Gulli, Romani (2004) (Correct)
No context found.
S. Chien, C. Dwork, S. Kumar, and D. Sivakumar. Towards exploiting link evolution, 2001.
A Survey of Eigenvector Methods of Web Information Retrieval - Langville, Meyer (2004) (2 citations) (Correct)
No context found.
Steve Chien, Cynthia Dwork, Ravi Kumar, and D. Sivakumar. Towards exploiting link evolution.
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