Short Course: Sparse Representations and High Dimensional Geometry : In conjunction with the AMS 2007 Von Neumann Symposium

May 30 - June 1, 2007

Schedule


Wednesday, May 30, 2007

9:00 - 9:50
10:00 - 10:50
11:20 - 12:10
2:00 - 2:50
3:20 - 4:10
Roman Vershynin (University of California, Davis (UC Davis))

Analysis of Random Measurements: Lecture II
Audio (MP3 File, Podcast Ready)
PDF Presentation

4:20 - 5:10
Roman Vershynin (University of California, Davis (UC Davis))

Analysis of Random Measurements: Lecture III
Audio (MP3 File, Podcast Ready)
PDF Presentation


Thursday, May 31, 2007

9:00 - 9:50
Anna Gilbert (University of Michigan)

What makes sublinear algorithms so fast? Lecture I

10:00 - 10:50
Anna Gilbert (University of Michigan)

What makes sublinear algorithms so fast? Lecture II

11:00 - 11:50
Anna Gilbert (University of Michigan)

What makes sublinear algorithms so fast? Lecture III

1:00 - 1:50
2:00 - 2:40
2:50 - 3:40
3:50 - 4:40
4:50 - 5:40
Jared Tanner (University of Utah)

Convex Relaxation and Polytopes: Lecture III


Friday, June 1, 2007

9:00 - 9:50
10:00 - 10:50
Justin Romberg (Georgia Institute of Technology)

Uncertainty Principles and Sparse Recovery: Lecture II

11:20 - 12:10
Justin Romberg (Georgia Institute of Technology)

Uncertainty Principles and Sparse Recovery: Lecture III

2:00 - 2:50
3:00 - 3:50
4:20 - 5:10