6.850  Geometric Computing

Presentations, part II

Hi all,

Here is the schedule for the presentations, starting Wednesday next week. If you have any questions or comments, let me know.

Best,

Piotr

* Wednesday, May 9: 8 presentations, 5-7 mins long (+3 min questions)

Presenters: Elyot Grant, Sepideh Mahabadi, Andreea Gane, Sean Simmons, Andres Lopez-Pineda, Tatsunori Hashimoto, Sarah Eisenstat, Cosmin Gheorghe

* Monday, May 14: 10 presentations, 5 minutes long (+3 min questions) unless specified otherwise

Presenters: Sanja Popovic, Sudeep Pillai, Sang Woo Jun, Adriana Schulz, Youssef Mroueh, Mark Zhang, Yevgeni Berzak+ (10 mins total), Peter Boyer, Fadel Abib++(10 mins total), Huang Dawei

* Monday, May 16: 10 presentations, 5 minutes long (+3 min questions) unless specified otherwise

Presenters: Ilia Lebedev, Ludwig Schmidt, Thomas Wortmann, Jin Hao Wan+ (10 mins total), Adrian Vladu+ (10 mins total), Valentina Hijung Shin, Jennifer Jacobs, Deniz Yorukoglu, Justin Lan+ (10 mins total), Bar Shalem

Announced on 02 May 2012  11:37  p.m. by Piotr Indyk

Bibliography

Lecture 11
A Simple Randomized Sieve Algorithm for the Closest-Pair Problem, S. Khuller and Y. Matias, Information and Computation, 118:1 (April 1995), pp. 34-37.
http://www.cs.umd.edu/~samir/grant/cp95.ps

Lecture 12
Linear programming: randomization and abstract frameworks
B Gartner, E Welzl, STACS 96
http://people.inf.ethz.ch/~gaertner/texts/own_work/stacs_lp.pdf

Lecture 14
Efficient search for approximate nearest neighbor in high dimensional spaces
E Kushilevitz, R Ostrovsky, Y Rabani, STOC, 1998.
http://www.cs.technion.ac.il/~rabani/Papers/KushilevitzOR-SICOMP-revised.pdf

Lecture 15
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
Sariel Har-Peled, Piotr Indyk, and Rajeev Motwani.
http://valis.cs.uiuc.edu/~sariel/papers/12/him/

Lecture 16
Approximation schemes for covering and packing problems in image processing and VLSI
DS Hochbaum, W Maass, Journal of the ACM (JACM), 1985.
http://web.cs.du.edu/~snarayan/sada/research/docs/p130-hochbaum.pdf

Lecture 17
Too many references to list; also, the lecture notes are self-contained.

Lecture18
Crossing numbers and hard Erdös problems in discrete geometry
LA Székely, Combinatorics, Probability and Computing, 1997
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.125.1484&rep=rep1&type=pdf

Lecture 19
Low distortion geometric embeddings (tutorial)
http://people.csail.mit.edu/indyk/tut.pdf

Announced on 12 April 2012  5:49  p.m. by Piotr Indyk

Free electronic copy of the book!

At least if you are at MIT. Follow this link:

http://www.springerlink.com/content/978-3-540-77973-5#section=149418&page=1&locus=0

Thanks to Sanja for the reference.

Piotr

Announced on 23 February 2012  4:32  p.m. by Piotr Indyk