Difference between revisions of "Class meeting for 10-605 Randomized"
From Cohen Courses
Jump to navigationJump to search (→Slides) |
|||
| Line 5: | Line 5: | ||
* [http://www.cs.cmu.edu/~wcohen/10-605/randomized-algs.pptx Slides in Powerpoint - what I thought was the lecture] | * [http://www.cs.cmu.edu/~wcohen/10-605/randomized-algs.pptx Slides in Powerpoint - what I thought was the lecture] | ||
| − | + | ||
| + | |||
| + | * [http://www.cs.cmu.edu/~wcohen/10-605/bloomfilter.py Python demo code for Bloom filter] | ||
=== Optional Readings === | === Optional Readings === | ||
Revision as of 16:51, 18 February 2015
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Spring_2015.
Slides
Optional Readings
- Online Generation of Locality Sensitive Hash Signatures. Benjamin Van Durme and Ashwin Lall. ACL Short. 2010
- Sketch Algorithms for Estimating Point Queries in NLP. Amit Goyal, Hal Daume III, and Graham Cormode, EMNLP 2012]
