메뉴 건너뛰기




Volumn 209, Issue 4, 2011, Pages 737-747

Exponential time improvement for min-wise based algorithms

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAM; ERROR BOUND; EXPONENTIAL TIME; HASH VALUE; NOVEL TECHNIQUES; RANDOM CHOICE; RANDOM FUNCTIONS; RANDOM WALK; RUNTIMES; SIMILARITY ESTIMATION; TIME AND SPACE;

EID: 79951789742     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2011.01.005     Document Type: Article
Times cited : (5)

References (31)
  • 1
    • 0032777414 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 8
    • 70350625168 scopus 로고    scopus 로고
    • 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
  • 10
    • 35348911985 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 13
    • 35348914807 scopus 로고    scopus 로고
    • 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
  • 19
    • 78449303897 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 26
    • 0033907633 scopus 로고    scopus 로고
    • 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


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