Difference between revisions of "Class meeting for 10-605 Graphs 2"
From Cohen Courses
Jump to navigationJump to search (Created page with "This is one of the class meetings on the schedule for the course Machine Learning with Large Data...") |
(→Slides) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 4: | Line 4: | ||
=== Slides === | === Slides === | ||
| − | * [http://www.cs.cmu.edu/~wcohen/10-605/randomized-algs.pptx Slides in Powerpoint] | + | * [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/bloom-filters.pptx Slides in Powerpoint - Bloom filters] | ||
| + | ** [http://www.cs.cmu.edu/~wcohen/10-605/bloomfilter.py Python demo code for Bloom filter] | ||
=== Optional Readings === | === Optional Readings === | ||
Latest revision as of 09:15, 28 April 2014
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Spring_2014.
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]
