DocSlides

PDF-One Permutation Hashing Ping Li Department of Statistical Science Cornell University Art B Owen Department of Statistics Stanford University CunHui Zhang Department of Statistics Rutgers University A

SO

lois-ondreau

Published 2014-12-19 | 8314 Views

One Permutation Hashing Ping Li Department of Statistical Science Cornell University Art B Owen Department of Statistics Stanford University CunHui Zhang Department of Statistics Rutgers University A
Recently bit minwise hashing has been applied to largescale learning and sublinear time near neighbor search The major drawback of minwise hashing is the expensive

Download Presentation

Download Presentation The PPT/PDF document "One Permutation Hashing Ping Li Departme..." 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.

Presentation Transcript

Related Topics