Fall 2007 Retreat

OCTOBER 9, 2007

8:00 am Van leaves campus
8:30 - 8:50 am Check-in & Continental Breakfast
8:50 - 8:55 am Welcome
Leonard Schulman
8:55 - 9:20 am

Joel Tropp
Algorithms for Sparse Approximation
9:20 - 9:45 am Shripad Thite
Walking Your Dog in the Woods in Polynomial Time
9:45 - 10:10 am Ho-Lin Chen
Robust Self-Assembly
10:10 - 10:35 am Vera Asodi
Multi-node Graphs: A framework for Multiplexed Biological Assays
10:35 - 10:50 am Break
10:50 - 11:15 am Adam Wierman
Should we worry about starving large jobs?
11:15 - 11:40 pm Sayan Mitra
Proving approximate implementations
11:40 - 12:05 pm Ben Recht
Efficient Algorithms, Large Deviations, and Quality Guarantees in Rank Optimization
12:05 - 1:05 pm Lunch
1:05 - 1:30 pm Michelle Effros
On Algorithms and Information Theory
1:30 - 1:55 pm Yury Lifshits
Similarity Search: A Web Perspective
1:55 - 2:20 pm Jiawang Nie
SDP representation of convex sets
2:20 - 2:45 pm Eyal Rozenman
Random walks on groups
2:45 - 3:00 pm Break
3:00 - 3:25 pm Yair Bartal
New Concepts in Metric Embedding
3:25 - 3:50 pm Asaf Cohen
Scanning and sequential decision making for multidimensional data
3:50 - 4:15 pm Elona Erez
Delay and loss considerations in network coding
4:15 - 4:40 pm Farzad Parvaresh
Explicit Measurements with Almost Optimal Thresholds for Compressed Sensing
4:40 - 4:55 pm Break
4:55 - 5:20 pm Peter Schröder
Discrete Conformal Structures
5:20 - 5:45 pm Yuval Cassuto
The Theory and Practice of Correcting Flash-Memory Errors
5:45 - 6:10 pm John Doyle
Architecture and Complexity
6:15 - 7:30 pm Dinner
7:30 pm Van returns to campus

Logistical details will be sent out by email.