메뉴 건너뛰기




Volumn 2003-January, Issue , 2003, Pages 58-68

Distributed pagerank for P2P systems

Author keywords

Chaos; Computer networks; Distributed algorithms; Distributed computing; Internet; Iterative algorithms; Keyword search; Linear systems; Peer to peer computing; Telecommunication traffic

Indexed keywords

ALGORITHMS; CHAOS THEORY; COMPUTER NETWORKS; DISTRIBUTED PARAMETER NETWORKS; INTERNET; ITERATIVE METHODS; LEARNING ALGORITHMS; LINEAR SYSTEMS; PARALLEL ALGORITHMS; PEER TO PEER NETWORKS; SEARCH ENGINES; TELECOMMUNICATION TRAFFIC; WEBSITES;

EID: 36949002218     PISSN: 10828907     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPDC.2003.1210016     Document Type: Conference Paper
Times cited : (70)

References (23)
  • 1
    • 4344570923 scopus 로고    scopus 로고
    • PageRank Explained. http://www.webrankinfo.com/english/pagerank/.
    • PageRank Explained
  • 3
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • July
    • B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, July 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.1
  • 11
    • 0004255482 scopus 로고    scopus 로고
    • Efficient computation of pagerank
    • Stanford Digital Library Technologies Project
    • T. Haveliwala. Efficient computation of pagerank. Technical Report 1999-31, Stanford Digital Library Technologies Project, 1999.
    • (1999) Technical Report 1999-31
    • Haveliwala, T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.