Lecture Home
 		Thursday, March 22, 2007

  Clark Center Auditorium
1:30pm Welcome
Abbas El Gamal, ISL Director, Stanford University
1:40pm Q&A with TK
Submit a question!
2:45pm Introduction, Sergio Verdu
3:00pm The Kailath Lecture
David Forney (bio)
Codes and Graphical Models:  A Personal Survey
4:00pm Reception at the Clark Center
6:30pm Banquet honoring David Forney at the Faculty Club
Friday, March 23, 2007

  Packard 101
  Colloquium on Codes and Graphical Models
8:45am Welcome,  Andrea Montanari and Balaji Prabhakar
9:00am Brendan Frey, University of Toronto

The affinity propagation algorithm for identifying data centers

9:45am Emmanuel Candes, California Institute of Technology

Applications of Compressive Sampling to Error Correction

10:30am Break
11:00am Mohsen Bayati, Stanford University

A Rigorous Analysis of the Cavity Method for Counting Matchings

11:20am Ciamac Moallemi, Stanford University

A Message-Passing Paradigm for Decentralized Optimization

11:45am Rudiger Urbanke, EPFL-Lausanne (bio)

How to find Good Finite-Length Codes: A Scaling Approach

12:30pm Lunch
1:30pm Andrea Montanari, Stanford University
2:15pm Michael Jordan, University of California-Berkeley

Hierarchical Nonparametric Bayesian Models

3:00pm Break
3:30pm

Leonard Schulman, California Institute of Technology

Tree codes in communication, control and cryptography

4:15pm

Balaji Prabhakar, Stanford University

Passing messages over counter braids: A new approach to network traffic measurement

5:00pm Closing Reception