Asymmetric LSH ALSH for Sublinear Time Maximum Inner P
cornelledu Ping Li Department of Statistics and Biostatistics Department of Computer Science Rutgers University Piscataway NJ 08854 USA pinglistatrutgersedu Abstract We present the 64257rst provably sublinear time hashing algorithm for approximate Ma
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "Asymmetric LSH ALSH for Sublinear Time M..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.