<--- Back to Details
First PageDocument Content
Search algorithms / Information science / Statistical classification / Information retrieval / Learning / Machine learning / Dimension reduction / Hashing / K-nearest neighbors algorithm / Support vector machine / Jeffrey Ullman / Locality-sensitive hashing
Date: 2014-08-11 14:11:58
Search algorithms
Information science
Statistical classification
Information retrieval
Learning
Machine learning
Dimension reduction
Hashing
K-nearest neighbors algorithm
Support vector machine
Jeffrey Ullman
Locality-sensitive hashing

Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs.

Add to Reading List

Source URL: mmds.org

Download Document from Source Website

File Size: 2,59 MB

Share Document on Facebook

Similar Documents

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

DocID: 1xUN2 - View Document

Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html | pdf | kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that

Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html | pdf | kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that

DocID: 1xTR9 - View Document

Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions

Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions

DocID: 1xTdH - View Document