-
1
-
-
4344570923
-
-
PageRank Explained. http://www.webrankinfo.com/english/pagerank/.
-
PageRank Explained
-
-
-
3
-
-
0014814325
-
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
-
4
-
-
0000730404
-
Graph structure in the web: Experiments and models
-
A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, , and J. Wiener. Graph structure in the web: experiments and models. In Proceedings of the 9th World Wide Web Conference, 2000.
-
(2000)
Proceedings of the 9th World Wide Web Conference
-
-
Broder, A.1
Kumar, R.2
Maghoul, F.3
Raghavan, P.4
Rajagopalan, S.5
Stata, R.6
Tomkins, A.7
Wiener, J.8
-
7
-
-
0036184272
-
Protecting free expression online with freenet
-
I. Clarke, T. W. Hong, S. G. Miller, O. Sandberg, and B. Wiley. Protecting free expression online with freenet. IEEE Internet Computing, 6(1):40-49, 2002.
-
(2002)
IEEE Internet Computing
, vol.6
, Issue.1
, pp. 40-49
-
-
Clarke, I.1
Hong, T.W.2
Miller, S.G.3
Sandberg, O.4
Wiley, B.5
-
11
-
-
0004255482
-
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
-
14
-
-
84880487682
-
Extrapolation methods for accelerating pagerank computations
-
S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Extrapolation methods for accelerating pagerank computations. In Proceedings of the Twelfth International World Wide Web Conferemce, WWW 2003, To Appear, 2003.
-
(2003)
Proceedings of the Twelfth International World Wide Web Conferemce, WWW 2003, to Appear
-
-
Kamvar, S.1
Haveliwala, T.2
Manning, C.3
Golub, G.4
-
15
-
-
0141946887
-
-
Technical report, Princeton
-
A. Z. Kronfol. FASD: A Fault-tolerant, Adaptive, Scalable, Distributed Search Engine. Technical report, Princeton, 2002.
-
(2002)
FASD: A Fault-tolerant, Adaptive, Scalable, Distributed Search Engine
-
-
Kronfol, A.Z.1
-
17
-
-
0003780986
-
-
Technical report, Stanford Digital Library Technologies Project
-
L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
-
(1998)
The Pagerank Citation Ranking: Bringing Order to the Web
-
-
Page, L.1
Brin, S.2
Motwani, R.3
Winograd, T.4
-
18
-
-
0842266368
-
A scalable content addressable network
-
Berkeley, CA
-
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. Technical Report TR-00-010, Berkeley, CA, 2000.
-
(2000)
Technical Report TR-00-010
-
-
Ratnasamy, S.1
Francis, P.2
Handley, M.3
Karp, R.4
Shenker, S.5
-
22
-
-
0034782005
-
Chord: A scalable peer-to-peer lookup service for internet applications
-
I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149-160, 2001.
-
(2001)
Proceedings of the 2001 ACM SIGCOMM Conference
, pp. 149-160
-
-
Stoica, I.1
Morris, R.2
Karger, D.3
Kaashoek, F.4
Balakrishnan, H.5
-
23
-
-
24944462144
-
Framework for peer-to-peer distributed computing in a heterogeneous, decentralized environment
-
November
-
J. Verbeke, N. Nadgir, G. Ruetsch, and I. Sharapov. Framework for peer-to-peer distributed computing in a heterogeneous, decentralized environment. In Proceedings of the 3rd International Workshop on Grid Computing, November 2002.
-
(2002)
Proceedings of the 3rd International Workshop on Grid Computing
-
-
Verbeke, J.1
Nadgir, N.2
Ruetsch, G.3
Sharapov, I.4
|