Fall 2009 ~ CMI 5th Anniversary Workshop ~
November 9th and  10th,  2009

8:00 - 8:30 am

Check-in & Continental Breakfast

8:30 - 8:40 am

Welcome ~ Leonard Schulman

8:45 - 9:15 am

Cedric Langbort - On Real-Time Pricing for Strategic Agents

9:15 - 10:00 am

Asu Ozdaglar - Distributed Subgradient Methods over Random Networks

10:00 - 10:30 am

Vijay Gupta - Communication Across Line Networks with Feedback using Consensus based Schemes

10:30 - 10:45 am

Break

10:45 - 11:15 am

Constantine Caramanis - High Dimensional Principal Component Analysis with Contaminated Data

11:15 - 12:00 am

Yuval Rabani - Explicit Dimension Reduction and Its Applications

12:00 - 1:30 pm

Lunch

1:30 - 2:00 pm

Michael Langberg - Codes against Online Adversaries

2:00 - 2:30 pm

Alex Sprintson - Network Coding Algorithms for Cooperative Information Exchange in Wireless Networks

2:30 - 3:00 pm

Alexandros Dimakis - LP relaxations: Compressed Sensing and LDPC codes

3:00 - 3:30 pm

Break

3:30 - 4:00 pm

Salman Avestimehr - "Connections between information flow in wireline networks and wireless networks"

4:00 - 4:45 pm

Alon Orlitsky - Probability Estimation over Large Alphabets

4:45 - 5:15 pm

Shirin Jalali - Implementable schemes for universal lossy compression

5:15 - 6:30 pm

Wine & Cheese reception (Annenberg Lounge)

6:40 - 8:30 pm

Banquet ~ Athenaeum

 

Tuesday, November 10th,  2009

8:45 - 9:15 am

Ben Recht - A brief history of low-rank matrix completion

9:15 - 9:45 am

Lin Xiao - Regularized Dual Averaging Method for Stochastic Learning and Online Optimization

9:45 - 10:15 am

Daniel Golovin - Online Maximization of  Submodular Functions

10:15 - 10:30 am

Break

10:30 - 11:00 am

Risi Kondor - A Fourier space algorithm for solving quadratic assignment problems

11:00 - 11:30 am

Jiawang Nie - Regularization methods for large scale polynomial optimization

11:30 - 12:00 pm

Joel Tropp - Finding structure with randomness: Stochastic algorithms for computing approximate matrix decompositions

12:00 - 1:30 pm

Lunch

1:30 - 2:00 pm

Jie Gao - Greedy Routing with Guaranteed Delivery Using Ricci Flows

2:00 - 2:30 pm

Chaitanya Swamy - Approximation algorithms for envy-free profit-maximization problems

2:30 - 3:00 pm

Chris Umans - Fast Polynomial Factorization and Modular Composition

3:00 - 3:30 pm

Break

3:30 - 4:00 pm

Yury Lifshits - Evolution of two-sided markets

4:00 - 4:30 pm

Ho-Lin Chen - Fault-Tolerance in Asynchronous Circuits

4:30 - 5:00 pm

Adam Wierman – The impact of back-end scheduling in load balancing designs

 

End of Workshop