Richard J. Lipton
Andrew C. Yao
- 1 FLOYD, R.W. Algonthm 245: Treesort 3. Comm. ACM 7, 12 (Dec. 1964), 70l. Google Scholar
- 2 KLARNER, D A, AND RIVEST, R L A procedure for lmprovmg the upper bound for the number of n-ommoes Canad. J. Math 25 (1973), 585-602Google Scholar
- 3 KNUTH, D.E The Art of Computer Programming, Vol I FundamentalAlgortthms Addison-Wesley, Reading, Mass, 1968 Google Scholar
- 4 KNUTH, D E The Art of Computer Programming, Vol 3 Sorting and Searching. Addison-Wesley, Reading, Mass, 1973 Google Scholar
- 5 ROSENBERG, A L Managmg storage for extendible arrays SIAM J Comptng 4 (1975), 287-306Google Scholar
- 6 ROS~NaERG, A L On storing ragged arrays by hashing Math Syst Theory 10 (1976/77), 193-210Google Scholar
- 7 ROSENBERG, A L Direct-access storage of data structures Rlvtsta dt lnformattca VII (1977), 127-151Google Scholar
- 8 ROSENBERG, A L, AND STOCKMEYER, L J, Hashing schemes for extendible arrays J A CM 24, 2 (April 1977), 1999-221 Google Scholar
- 9 SNYDER, L On umquely representable data structures Proc 18th Annual IEEE Symp on Foundations of Computer Science, 1977, pp 142-146Google Scholar
- 10 VAN EMDE BOAS, P, KAAS, R, AND ZIJLSTRA, E Design and tmplementat,on of an efficient priority queue Math. Syst Theory 10 (1976/77), 99-127.Google Scholar
- 11 WHITTAKER, E T., AND WATSON, G N Modern Analysts. Cambndge U Press, London, 4th ed, 1958Google Scholar
- 12 YAO, A C, AND YAO, F.F. The complexity of searching an ordered random table Proc 17th Annual IEEE Symp on Foundauons of Computer Science, Houston, Texas, 1976, pp 173-177Google Scholar
Index Terms
- External Hashing Schemes for Collections of Data Structures
Recommendations
Data-oriented locality sensitive hashing
MM '10: Proceedings of the 18th ACM international conference on MultimediaLocality Sensitive Hashing (LSH) has been proposed as a scalable and high-dimensional index for approximate similarity search. Euclidean LSH is a variation of LSH and has been successfully used in many multimedia applications. However, hash functions of ...
Data-Dependent Locality Sensitive Hashing
Proceedings of the 15th Pacific-Rim Conference on Advances in Multimedia Information Processing --- PCM 2014 - Volume 8879Locality sensitive hashing LSH is the most popular algorithm for approximate nearest neighbor ANN search. As LSH partitions vector space uniformly and the distribution of vectors is usually non-uniform, it poorly fits real dataset and has limited ...
Comments