-
1
-
-
71049177089
-
Memetracking and the dynamics of the news cycle
-
J. Leskovec, L. Backstrom, and J. Kleinberg, "Memetracking and the dynamics of the news cycle," in A CM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2009, pp. 497-506.
-
(2009)
A CM SIGKDD Conf. on Knowledge Discovery and Data Mining
, pp. 497-506
-
-
Leskovec, J.1
Backstrom, L.2
Kleinberg, J.3
-
2
-
-
84864046010
-
Finding and exploring memes in social media
-
H. Ryu, M. Lease, and N. Woodward, "Finding and exploring memes in social media," in Hypertext, 2012, pp. 295-304.
-
(2012)
Hypertext
, pp. 295-304
-
-
Ryu, H.1
Lease, M.2
Woodward, N.3
-
3
-
-
80052655046
-
Collective graph identification
-
G. M. Namata, S. Kok, and L. Getoor, "Collective graph identification," in A CM SIGKDD Conf. on Knowledge Discovery and Data Mining, 2011, pp. 87
-
(2011)
A CM SIGKDD Conf. on Knowledge Discovery and Data Mining
, pp. 87
-
-
Namata, G.M.1
Kok, S.2
Getoor, L.3
-
7
-
-
84879823474
-
Homomorphic fingerprints under misalignments: Sketching edit and shift distances
-
A. Andoni, A. Goldberger, A. McGregor, and E. Porat, "Homomorphic fingerprints under misalignments: Sketching edit and shift distances," in A CM Symp. on Theory of Computing (ST O C), 2013, pp. 931-940.
-
(2013)
A CM Symp. on Theory of Computing (ST O C)
, pp. 931-940
-
-
Andoni, A.1
Goldberger, A.2
McGregor, A.3
Porat, E.4
-
8
-
-
84893120698
-
NIFTY: A system for large scale information flow tracking and clustering
-
C. Suen, S. Huang, C. Eksombatchai, R. Sosic, and J. Leskovec, "NIFTY: A system for large scale information flow tracking and clustering," in Int. Worid Wide Web Conf., 2013, pp. 1237-1248.
-
(2013)
Int. Worid Wide Web Conf.
, pp. 1237-1248
-
-
Suen, C.1
Huang, S.2
Eksombatchai, C.3
Sosic, R.4
Leskovec, J.5
-
9
-
-
57349180452
-
Generating links by mining quotations
-
O. Kolak and B. N. Schilit, "Generating links by mining quotations," in Hypertext, 2008, pp. 117-126.
-
(2008)
Hypertext
, pp. 117-126
-
-
Kolak, O.1
Schilit, B.N.2
-
11
-
-
84872359994
-
Something borrowed: Sequence alignment and the identification of similar passages in large text collections
-
R. Horton, M. Olsen, and G. Roe, "Something borrowed: Sequence alignment and the identification of similar passages in large text collections," Digital Studies / Le champ numerique, vol. 2, no. 1, 2010.
-
(2010)
Digital Studies / le Champ Numerique
, vol.2
, Issue.1
-
-
Horton, R.1
Olsen, M.2
Roe, G.3
-
13
-
-
79952425288
-
Efficient indexing of repeated n-grams
-
S. Huston, A. Moffat, and W. B. Croft, "Efficient indexing of repeated n-grams," in A CM Web Search and Data Mining Conf. (WSDM), 2011, pp. 127-136.
-
(2011)
A CM Web Search and Data Mining Conf. (WSDM)
, pp. 127-136
-
-
Huston, S.1
Moffat, A.2
Croft, W.B.3
-
14
-
-
84859921422
-
Pairwise document similarity in large collections with MapReduce
-
T. Elsayed, J. Lin, and D. W. Oard, "Pairwise document similarity in large collections with MapReduce," in A CL Short Papers, 2008, pp. 265-268.
-
(2008)
A CL Short Papers
, pp. 265-268
-
-
Elsayed, T.1
Lin, J.2
Oard, D.W.3
-
15
-
-
83055181761
-
Partial duplicate detection for large book collections
-
J. Z. Yalniz, E. F. Can, and R. Manmatha, "Partial duplicate detection for large book collections," in A CM Int. Conf. on Information and Knowledge Management (CIKM), 2011, pp. 469-574.
-
(2011)
A CM Int. Conf. on Information and Knowledge Management (CIKM)
, pp. 469-574
-
-
Yalniz, I.Z.1
Can, E.F.2
Manmatha, R.3
-
17
-
-
0016495233
-
Efficiency of a good but not linear set union algorithm
-
R. Tarjan, "Efficiency of a good but not linear set union algorithm," J. A CM, vol. 22, no. 2, pp. 215-225, 1975.
-
(1975)
J. A CM
, vol.22
, Issue.2
, pp. 215-225
-
-
Tarjan, R.1
-
18
-
-
77950537175
-
Regularization paths for generalized linear models via coordinate descent
-
J. Friedman, T. Hastie, and R. Tibshirani, "Regularization paths for generalized linear models via coordinate descent," 1. Statistical Software, vol. 33, no. 1, 2008.
-
(2008)
1. Statistical Software
, vol.33
, Issue.1
-
-
Friedman, J.1
Hastie, T.2
Tibshirani, R.3
|