-
1
-
-
0032777414
-
A small approximately min-wise independent family of hash functions
-
P. Indyk A small approximately min-wise independent family of hash functions Journal of Algorithms 1999 454 456
-
(1999)
Journal of Algorithms
, pp. 454-456
-
-
Indyk, P.1
-
2
-
-
70349672710
-
Tighter estimation using bottom k sketches
-
E. Cohen, and H. Kaplan Tighter estimation using bottom k sketches PVLDB 1 1 2008 213 224
-
(2008)
PVLDB
, vol.1
, Issue.1
, pp. 213-224
-
-
Cohen, E.1
Kaplan, H.2
-
4
-
-
0031353179
-
Size-Estimation Framework with Applications to Transitive Closure and Reachability
-
E. Cohen Size-estimation framework with applications to transitive closure and reachability Journal of Computer and System Sciences 55 3 1997 441 453 (Pubitemid 127432363)
-
(1997)
Journal of Computer and System Sciences
, vol.55
, Issue.3
, pp. 441-453
-
-
Cohen, E.1
-
5
-
-
84938057127
-
Estimating rarity and similarity over data stream windows
-
M. Datar, S. Muthukrishnan, Estimating rarity and similarity over data stream windows, in: Proceedings of 10th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 2461, 2002, pp. 323-334.
-
(2002)
Proceedings of 10th Annual European Symposium on Algorithms, Lecture Notes in Computer Science
, vol.2461
, pp. 323-334
-
-
Datar, M.1
Muthukrishnan, S.2
-
7
-
-
77953112255
-
Evaluating strategies for similarity search on the web
-
ACM
-
T.H. Haveliwala, A. Gionis, D. Klein, and P. Indyk Evaluating strategies for similarity search on the web WWW '02: Proceedings of the 11th International Conference on World Wide Web, New York, NY, USA 2002 ACM 432 442
-
(2002)
WWW '02: Proceedings of the 11th International Conference on World Wide Web, New York, NY, USA
, pp. 432-442
-
-
Haveliwala, T.H.1
Gionis, A.2
Klein, D.3
Indyk, P.4
-
8
-
-
70350625168
-
Sketching algorithms for approximating rank correlations in collaborative filtering systems
-
Y. Bachrach, R. Herbrich, and E. Porat Sketching algorithms for approximating rank correlations in collaborative filtering systems J. Karlgren, J. Tarhio, H. Hyyrö, SPIRE Lecture Notes in Computer Science vol. 5721 2009 Springer 344 352
-
(2009)
SPIRE Lecture Notes in Computer Science
, vol.5721
, pp. 344-352
-
-
Bachrach, Y.1
Herbrich, R.2
Porat, E.3
-
9
-
-
77957061059
-
Sketching techniques for collaborative filtering
-
Pasadena, California
-
Y. Bachrach, E. Porat, J.S. Rosenschein, Sketching techniques for collaborative filtering, in: The 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), Pasadena, California, 2009, pp. 2016-2021.
-
(2009)
The 21st International Joint Conference on Artificial Intelligence (IJCAI 2009)
, pp. 2016-2021
-
-
Bachrach, Y.1
Porat, E.2
Rosenschein, J.S.3
-
10
-
-
35348911985
-
Detecting near-duplicates for web crawling
-
DOI 10.1145/1242572.1242592, 16th International World Wide Web Conference, WWW2007
-
G.S. Manku, A. Jain, and A. Das Sarma Detecting near-duplicates for web crawling WWW '07: Proceedings of the 16th International Conference on World Wide Web, New York, NY, USA 2007 ACM 141 150 (Pubitemid 47582246)
-
(2007)
16th International World Wide Web Conference, WWW2007
, pp. 141-150
-
-
Manku, G.S.1
Jain, A.2
Das Sarma, A.3
-
11
-
-
29844455221
-
What's new: Finding significant differences in network data streams
-
DOI 10.1109/TNET.2005.860096
-
G. Cormode, and S. Muthukrishnan What's new: finding significant differences in network data streams IEEE/ACM Transactions on Networking 13 6 2005 1219 1232 (Pubitemid 43034131)
-
(2005)
IEEE/ACM Transactions on Networking
, vol.13
, Issue.6
, pp. 1219-1232
-
-
Cormode, G.1
Muthukrishnan, S.2
-
12
-
-
1142303685
-
Processing set expressions over continuous update streams
-
ACM
-
S. Ganguly, M. Garofalakis, and R. Rastogi Processing set expressions over continuous update streams SIGMOD '03: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, New York, NY, USA 2003 ACM 265 276
-
(2003)
SIGMOD '03: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, New York, NY, USA
, pp. 265-276
-
-
Ganguly, S.1
Garofalakis, M.2
Rastogi, R.3
-
13
-
-
35348914807
-
Google news personalization: Scalable online collaborative filtering
-
DOI 10.1145/1242572.1242610, 16th International World Wide Web Conference, WWW2007
-
A.S. Das, M. Datar, A. Garg, and S. Rajaram Google news personalization: scalable online collaborative filtering WWW '07: Proceedings of the 16th International Conference on World Wide Web, New York, NY, USA 2007 ACM 271 280 (Pubitemid 47582257)
-
(2007)
16th International World Wide Web Conference, WWW2007
, pp. 271-280
-
-
Das, A.S.1
Datar, M.2
Garg, A.3
Rajaram, S.4
-
14
-
-
0034832662
-
Estimating simple functions on the union of data streams
-
ACM
-
P.B. Gibbons, and S. Tirthapura Estimating simple functions on the union of data streams SPAA '01: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, New York, NY, USA 2001 ACM 281 291
-
(2001)
SPAA '01: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, New York, NY, USA
, pp. 281-291
-
-
Gibbons, P.B.1
Tirthapura, S.2
-
15
-
-
77953112255
-
Evaluating strategies for similarity search on the web
-
ACM
-
T.H. Haveliwala, A. Gionis, D. Klein, and P. Indyk Evaluating strategies for similarity search on the web WWW '02: Proceedings of the 11th International Conference on World Wide Web, New York, NY, USA 2002 ACM 432 442
-
(2002)
WWW '02: Proceedings of the 11th International Conference on World Wide Web, New York, NY, USA
, pp. 432-442
-
-
Haveliwala, T.H.1
Gionis, A.2
Klein, D.3
Indyk, P.4
-
16
-
-
33750311279
-
Near-duplicate detection by instance-level constrained clustering
-
ACM
-
H. Yang, and J. Callan Near-duplicate detection by instance-level constrained clustering SIGIR '06: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, NY, USA 2006 ACM 421 428
-
(2006)
SIGIR '06: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, NY, USA
, pp. 421-428
-
-
Yang, H.1
Callan, J.2
-
18
-
-
52649158132
-
Greedy list intersection
-
R. Krauthgamer, A. Mehta, V. Raman, A. Rudra, Greedy list intersection, in: IEEE 24th International Conference on Data Engineering, 2008 (ICDE 2008), 2008, pp. 1033-1042.
-
(2008)
IEEE 24th International Conference on Data Engineering, 2008 (ICDE 2008)
, pp. 1033-1042
-
-
Krauthgamer, R.1
Mehta, A.2
Raman, V.3
Rudra, A.4
-
19
-
-
78449303897
-
Fingerprinting ratings for collaborative filtering - Theoretical and empirical analysis
-
E. Chavez, S. Lonardi (Eds.) Springer
-
Y. Bachrach, R. Herbrich, Fingerprinting ratings for collaborative filtering - theoretical and empirical analysis, in: E. Chavez, S. Lonardi (Eds.), SPIRE, Lecture Notes in Computer Science, vol. 6393, Springer, 2010, pp. 25-36.
-
(2010)
SPIRE, Lecture Notes in Computer Science
, vol.6393
, pp. 25-36
-
-
Bachrach, Y.1
Herbrich, R.2
-
20
-
-
84969151029
-
A near-optimal algorithm for computing the entropy of a stream
-
N. Bansal, K. Pruhs, C. Stein (Eds.)
-
A. Chakrabarti, G. Cormode, A. McGregor, A near-optimal algorithm for computing the entropy of a stream, in: N. Bansal, K. Pruhs, C. Stein (Eds.), SODA, SIAM, 2007, pp. 328-335.
-
(2007)
SODA, SIAM
, pp. 328-335
-
-
Chakrabarti, A.1
Cormode, G.2
McGregor, A.3
-
22
-
-
0031620041
-
Min-wise independent permutations (extended abstract)
-
New York, NY, USA ACM
-
A.Z. Broder, M. Charikar, A.M. Frieze, and M. Mitzenmacher Min-wise independent permutations (extended abstract) STOC '98: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, New York, NY, USA 1998 ACM 327 336
-
(1998)
STOC '98: Proceedings of the 30th Annual ACM Symposium on Theory of Computing
, pp. 327-336
-
-
Broder, A.Z.1
Charikar, M.2
Frieze, A.M.3
Mitzenmacher, M.4
-
24
-
-
0010362121
-
Syntactic clustering of the web
-
Essex, UK Elsevier Science Publishers Ltd.
-
A.Z. Broder, S.C. Glassman, M.S. Manasse, and G. Zweig Syntactic clustering of the web Selected Papers from the Sixth International Conference on World Wide Web, Essex, UK 1997 Elsevier Science Publishers Ltd. 1157 1166
-
(1997)
Selected Papers from the Sixth International Conference on World Wide Web
, pp. 1157-1166
-
-
Broder, A.Z.1
Glassman, S.C.2
Manasse, M.S.3
Zweig, G.4
-
25
-
-
0033877655
-
Finding interesting associations without support pruning
-
E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, C. Yang, Finding interesting associations without support pruning, in: 16th International Conference on Data Engineering (ICDE2000), 2000.
-
(2000)
16th International Conference on Data Engineering (ICDE2000)
-
-
Cohen, E.1
Datar, M.2
Fujiwara, S.3
Gionis, A.4
Indyk, P.5
Motwani, R.6
Ullman, J.7
Yang, C.8
-
26
-
-
0033907633
-
Low discrepancy sets yield approximate min-wise independent permutation families
-
DOI 10.1016/S0020-0190(99)00163-5
-
M. Saks, A. Srinivasan, S. Zhou, and D. Zuckerman Low discrepancy sets yield approximate min-wise independent permutation families Proceedings of International Workshop on Randomization and Approximation Techniques in Computer Science 1999 Springer 29 32 (Pubitemid 30563377)
-
(2000)
Information Processing Letters
, vol.73
, Issue.1-2
, pp. 29-32
-
-
Saks, M.1
Srinivasan, A.2
Zhou, S.3
Zuckerman, D.4
-
27
-
-
77955322325
-
On the k-independence required by linear probing and min wise independence
-
Berlin, Heidelberg, Springer-Verlag
-
M. Pǎtracu, M. Thorup, On the k-independence required by linear probing and min wise independence, in: Proceedings of 37th International Colloquium on Automata, Languages and Programming, ICALP'10, Berlin, Heidelberg, Springer-Verlag 2010, pp. 715-726.
-
(2010)
Proceedings of 37th International Colloquium on Automata, Languages and Programming, ICALP'10
, pp. 715-726
-
-
Pǎtraşcu, M.1
-
28
-
-
84958668671
-
A derandomization using min-wise independent permutations
-
Springer
-
A.Z. Broder, M. Charikar, M. Mitzenmacher, A derandomization using min-wise independent permutations, in: Randomization and Approximation Techniques in Computer Science, Springer, pp. 15-24.
-
Randomization and Approximation Techniques in Computer Science
, pp. 15-24
-
-
Broder, A.Z.1
Charikar, M.2
Mitzenmacher, M.3
-
30
-
-
84959038140
-
Counting distinct elements in a data stream
-
Springer-Verlag
-
Z. Bar-Yossef, T.S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan Counting distinct elements in a data stream RANDOM '02: Proceedings of the 6th International Workshop on Randomization and Approximation Techniques, London, UK 2002 Springer-Verlag 1 10
-
(2002)
RANDOM '02: Proceedings of the 6th International Workshop on Randomization and Approximation Techniques, London, UK
, pp. 1-10
-
-
Bar-Yossef, Z.1
Jayram, T.S.2
Kumar, R.3
Sivakumar, D.4
Trevisan, L.5
-
31
-
-
77954742764
-
An optimal algorithm for the distinct elements problem
-
ACM
-
D.M. Kane, J. Nelson, and D.P. Woodruff An optimal algorithm for the distinct elements problem PODS '10: Proceedings of the 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems of Data, New York, NY, USA 2010 ACM 41 52
-
(2010)
PODS '10: Proceedings of the 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems of Data, New York, NY, USA
, pp. 41-52
-
-
Kane, D.M.1
Nelson, J.2
Woodruff, D.P.3
|