-
2
-
-
0033714666
-
Webbase: A Repository of Web
-
J. Hirai, S. Raghavan, H. Garcia-Molina, and A. Paepcke, "Webbase: A Repository of Web Pages," Proc. Ninth World Wide Web Conf. (WWW), pp. 277-293, 2000.
-
(2000)
, pp. 277-293
-
-
Hirai, J.1
Raghavan, S.2
Garcia-Molina, H.3
Paepcke, A.4
-
3
-
-
0003780986
-
The PageRank Citation Ranking: Bringing Order to the Web
-
Technical Report 1999-66, Stanford Univ
-
L. Page, S. Brin, R. Motwani, and T. Winograd, "The PageRank Citation Ranking: Bringing Order to the Web," Technical Report 1999-66, Stanford Univ., 1998
-
(1998)
-
-
Page, L.1
Brin, S.2
Motwani, R.3
Winograd, T.4
-
4
-
-
0033293618
-
Finding Related Pages in the World Wide Web
-
J. Dean and M.R. Henzinger, "Finding Related Pages in the World Wide Web," Computer Networks, vol. 31, no. 11, pp. 1467-1479, 1999.
-
(1999)
Computer Networks
, vol.31
, Issue.11
, pp. 1467-1479
-
-
Dean, J.1
Henzinger, M.R.2
-
5
-
-
4243148480
-
Authoritative Sources in a Hyperlinked Environment
-
J. Kleinberg, "Authoritative Sources in a Hyperlinked Environment," J. ACM vol. 46, no. 5, pp. 604-632, 1999.
-
(1999)
J. ACM
, vol.46
, Issue.5
, pp. 604-632
-
-
Kleinberg, J.1
-
6
-
-
33947620979
-
Node Similarity in Networked Information Spaces
-
W. Lu, J. Janssen, E. Milios, and N. Japkowicz, "Node Similarity in Networked Information Spaces," Proc. 2001 Conf. Centre for Advanced Studies on Collaborative Research, p. 11, 2001.
-
(2001)
Proc. 2001 Conf. Centre for Advanced Studies on Collaborative Research
, pp. 11
-
-
Lu, W.1
Janssen, J.2
Milios, E.3
Japkowicz, N.4
-
8
-
-
34250725631
-
A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph
-
Mar
-
D. Fogaras and B. Rácz, "A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph," Proc. Clustering Information over the Web Workshop, pp. 557-567, Mar. 2004.
-
(2004)
Proc. Clustering Information over the Web Workshop
, pp. 557-567
-
-
Fogaras, D.1
Rácz, B.2
-
10
-
-
0032090684
-
Enhanced Hypertext Categorization Using Hyperlinks
-
S. Chakrabarti, B.E. Dom, and P. Indyk, "Enhanced Hypertext Categorization Using Hyperlinks," Proc. SIGMOD '98, ACM Int'l Conf. Management of Data, pp. 307-318, 1998.
-
(1998)
Proc. SIGMOD '98, ACM Int'l Conf. Management of Data
, pp. 307-318
-
-
Chakrabarti, S.1
Dom, B.E.2
Indyk, P.3
-
11
-
-
77953112255
-
Evaluating Strategies for Similarity Search on the Web
-
T.H. Haveliwala, A. Gionis, D. Klein, and P. Indyk, "Evaluating Strategies for Similarity Search on the Web," Proc. 11th World Wide Web Conf. (WWW), pp. 432-442, 2002.
-
(2002)
Proc. 11th World Wide Web Conf. (WWW)
, pp. 432-442
-
-
Haveliwala, T.H.1
Gionis, A.2
Klein, D.3
Indyk, P.4
-
12
-
-
0242625288
-
ANF: A Fast and Scalable Tool for Data Mining in Massive Graphs
-
C.R. Palmer, P.B. Gibbons, and C. Faloutsos, "ANF: A Fast and Scalable Tool for Data Mining in Massive Graphs," Proc. Eighth ACM Int'l Conf. Knowledge Discovery and Data Mining (SIGKDD), pp. 81-90, 2002.
-
(2002)
Proc. Eighth ACM Int'l Conf. Knowledge Discovery and Data Mining (SIGKDD)
, pp. 81-90
-
-
Palmer, C.R.1
Gibbons, P.B.2
Faloutsos, C.3
-
13
-
-
0037818472
-
I/O-Efficient Techniques for Computing PageRank
-
Y.-Y. Chen, Q. Gan, and T. Suel, "I/O-Efficient Techniques for Computing PageRank," Proc. 11th Int'l Conf. Information and Knowledge Management, pp. 549-557, 2002.
-
(2002)
Proc. 11th Int'l Conf. Information and Knowledge Management
, pp. 549-557
-
-
Chen, Y.-Y.1
Gan, Q.2
Suel, T.3
-
14
-
-
0004255482
-
Efficient Computation of PageRank
-
Technical Report 1999-31, Stanford Univ
-
T.H. Haveliwala, "Efficient Computation of PageRank," Technical Report 1999-31, Stanford Univ., 1999.
-
(1999)
-
-
Haveliwala, T.H.1
-
15
-
-
12244308827
-
An Analytical Comparison of Approaches to Personalizing PageRank
-
Technical Report 2003-35, Stanford Univ
-
T.H. Haveliwala, S. Kamvar, and G. Jeh, "An Analytical Comparison of Approaches to Personalizing PageRank," Technical Report 2003-35, Stanford Univ., 2003.
-
(2003)
-
-
Haveliwala, T.H.1
Kamvar, S.2
Jeh, G.3
-
16
-
-
84924122981
-
Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
-
D. Fogaras, B. Rácz, K. Csalogány, and T. Sarlós, "Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments," Internet Math., vol. 2, no. 3, pp. 333-358, 2005.
-
(2005)
Internet Math
, vol.2
, Issue.3
, pp. 333-358
-
-
Fogaras, D.1
Rácz, B.2
Csalogány, K.3
Sarlós, T.4
-
18
-
-
0031353179
-
Size-Estimation Framework with Applications to Transitive Closure and Reachability
-
E. Cohen, "Size-Estimation Framework with Applications to Transitive Closure and Reachability," J. Computer Systems Science, vol. 55, no. 3, pp. 441-453, 1997.
-
(1997)
J. Computer Systems Science
, vol.55
, Issue.3
, pp. 441-453
-
-
Cohen, E.1
-
19
-
-
0031644241
-
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality
-
P. Indyk and R. Motwani, "Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality," Proc. 30th ACM Symp. Theory of Computing (STOC), pp. 604-613, 1998.
-
(1998)
Proc. 30th ACM Symp. Theory of Computing (STOC)
, pp. 604-613
-
-
Indyk, P.1
Motwani, R.2
-
20
-
-
0033705620
-
On Near-Uniform URL Sampling
-
M.R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, "On Near-Uniform URL Sampling," Proc. Ninth Int'l World Wide Web Conf. Computer Networks, pp. 295-308, 2000.
-
(2000)
Proc. Ninth Int'l World Wide Web Conf. Computer Networks
, pp. 295-308
-
-
Henzinger, M.R.1
Heydon, A.2
Mitzenmacher, M.3
Najork, M.4
-
21
-
-
77955757374
-
Methods for Sampling Pages Uniformly from the World Wide Web
-
P. Rusmevichientong, D.M. Pennock, S. Lawrence, and C.L. Giles, "Methods for Sampling Pages Uniformly from the World Wide Web," Proc. AAAI Fall Symp. Using Uncertainty Within Computation, pp. 121-128, 2001.
-
(2001)
Proc. AAAI Fall Symp. Using Uncertainty Within Computation
, pp. 121-128
-
-
Rusmevichientong, P.1
Pennock, D.M.2
Lawrence, S.3
Giles, C.L.4
-
22
-
-
84877354667
-
Approximating Aggregate Queries about Web Pages via Random Walks
-
Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz, "Approximating Aggregate Queries about Web Pages via Random Walks," Proc. 26th Int'l Conf. Very Large Data Bases, pp. 535-544, 2000.
-
(2000)
Proc. 26th Int'l Conf. Very Large Data Bases
, pp. 535-544
-
-
Bar-Yossef, Z.1
Berg, A.2
Chien, S.3
Fakcharoenphol, J.4
Weitz, D.5
-
23
-
-
19944375505
-
Sic Transit Gloria Telae: Towards an Understanding of the Web's Decay
-
Z. Bar-Yossef, A.Z. Broder, R. Kumar, and A. Tomkins, "Sic Transit Gloria Telae: Towards an Understanding of the Web's Decay," Proc. 13th World Wide Web Conf. (WWW), pp. 328-337, 2004.
-
(2004)
Proc. 13th World Wide Web Conf. (WWW)
, pp. 328-337
-
-
Bar-Yossef, Z.1
Broder, A.Z.2
Kumar, R.3
Tomkins, A.4
-
24
-
-
84885578920
-
Scalable Collaborative Filtering Using Cluster-Based Smoothing
-
G.-R. Xue, C. Lin, Q. Yang, W. Xi, H.-J. Zeng, Y. Yu, and Z. Chen, "Scalable Collaborative Filtering Using Cluster-Based Smoothing," Proc. 28th Ann. Int'l ACM SIGIR Conf. Research and Development in Information Retrieval, pp. 114-121, 2005.
-
(2005)
Proc. 28th Ann. Int'l ACM SIGIR Conf. Research and Development in Information Retrieval
, pp. 114-121
-
-
Xue, G.-R.1
Lin, C.2
Yang, Q.3
Xi, W.4
Zeng, H.-J.5
Yu, Y.6
Chen, Z.7
-
25
-
-
0001284253
-
Computing on Data Streams, External Memory Algorithms
-
M.R. Henzinger, P. Raghavan, and S. Rajagopalan, "Computing on Data Streams," External Memory Algorithms, DIMACS Book Series, vol. 50, pp. 107-118, 1999.
-
(1999)
DIMACS Book Series
, vol.50
, pp. 107-118
-
-
Henzinger, M.R.1
Raghavan, P.2
Rajagopalan, S.3
-
26
-
-
0038722393
-
The Complexity of Massive Data Set Computations,
-
PhD dissertation, Univ. of California at Berkeley
-
Z. Bar-Yossef, "The Complexity of Massive Data Set Computations," PhD dissertation, Univ. of California at Berkeley, 2002.
-
(2002)
-
-
Bar-Yossef, Z.1
-
27
-
-
84896746147
-
A Functional Approach to External Graph Algorithms
-
J. Abello, A.L. Buchsbaum, and J. Westbrook, "A Functional Approach to External Graph Algorithms," Proc. European Symp. Algorithms, pp. 332-343, 1998.
-
(1998)
Proc. European Symp. Algorithms
, pp. 332-343
-
-
Abello, J.1
Buchsbaum, A.L.2
Westbrook, J.3
-
28
-
-
0034207121
-
Min-Wise Independent Permutations
-
A.Z. Broder, M. Charikar, A.M. Frieze, and M. Mitzenmacher, "Min-Wise Independent Permutations," J. Computer and System Sciences, vol. 60, no. 3, pp. 630-659, 2000.
-
(2000)
J. Computer and System Sciences
, vol.60
, Issue.3
, pp. 630-659
-
-
Broder, A.Z.1
Charikar, M.2
Frieze, A.M.3
Mitzenmacher, M.4
-
30
-
-
33947617675
-
-
Open Directory Project ODP
-
"Open Directory Project (ODP)," http://www.dmoz.org, 2005.
-
(2005)
-
-
|