2004-2005 Schedule

• September 30, 2004
  • Compressed Sensing
  • Dave Donoho, Stanford University
  • TBA

• Thursday, October 14, 2004:
  • Opportunistic coding for wireless channels
  • Suhas Diggavi, EPFL
  • Packard 101, 4:15-5:15 pm

• Thursday, October 21, 2004:
  • Robust optimization: Models and Applications
  • Garud Iyengar, Columbia University
  • Packard 101, 4:15-5:15 pm

• Thursday, October 28, 2004:
  • Algorithmic self-assembly: Efficiency and error-correction
  • Ashish Goel, Stanford University
  • Packard 101, 4:15-5:15 pm

• Thursday, November 4, 2004:
  • Noise and Reliability in Genetic Regulatory Circuits
  • Harley McAdams, Stanford University
  • Packard 202, 4:15-5:15 pm

• Thursday, November 11, 2004:
  • New Bounds on the Entropy Rate of Hidden Markov Processes
  • Tsachy Weissman, Stanford University
  • Packard 101, 4:15-5:15 pm

• Thursday, November 18, 2004:
  • Network Utility Maximization: Advances and Applications
  • Mung Chiang, Princeton University
  • Packard 101, 12:30-1:30 pm

• Thursday, December 2, 2004:
  • Optimal Resource Allocation in Stochastic Wireless Networks
  • Edmund Yeh, Yale University
  • Packard 101, 4:15-5:15 pm

• Thursday, December 9, 2004:
  • Recent results in non-asymptotic Shannon theory
  • Dror Baron, Rice University
  • Packard 202, 4:15-5:15 pm

• Thursday, January 20, 2005:
  • Efficiency Loss in Market Mechanisms for Network Resource Allocation
  • Ramesh Johari, Stanford University
  • Packard 101, 4:15-5:15 pm

• Thursday, Feburary 3, 2005:
  • Quantization of overcomplete expansions by sigma-delta modulation
  • N. T. Thao, City University New York
  • Packard 101, 4:15-5:15 pm

• Thursday, February 10, 2005:
  • Accuracy of One-Bit Quantization
  • Sinan Gunturk, Courant Institute of Mathematical Sciences
  • Packard 101, 4:15-5:15 pm

• Thursday, February 17, 2005:
  • Feedback communication over unknown channels
  • Aslan Tchamkerten, EPFL
  • Packard 202, 4:15-5:15 pm

• Thursday, February 24, 2005:
  • Delay universality in channel and source coding
  • Anant Sahai, UC Berkeley
  • Packard 101, 4:15-5:15 pm

• Thursday, March 3, 2005:
  • Fast, Near-Optimal Quantizer Design
  • Michelle Effros, Caltech
  • Packard 101, 4:15-5:15 pm

• Thursday, March 10, 2005:
  • Neighborly Polytopes and Sparse Solutions of Underdetermined Linear Systems
  • David Donoho, Stanford University
  • Packard 202, 4:15-5:15 pm

• Thursday, April 7, 2005:
  • Random walk with reinforcement
  • Persi Diaconis, Stanford University
  • Packard 202, 4:15-5:15 pm

• Thursday, April 14, 2005:
  • Area Theorems for Iterative Coding Systems
  • Andrea Montanari, ENS, Paris
  • Packard 202, 4:15-5:15 pm

• Thursday, April 21, 2005:
  • Network Correlated Data Gathering
  • Razvan Cristescu, California Institute of Technology
  • Packard 101, 4:15-5:15 pm

• Thursday, April 28, 2005:
  • Noise distribution free local prediction accuracy of new and old statistical learning algorithms
  • Lee Jones, University of Massachusetts
  • Packard 101, 4:15-5:15 pm

• Thursday, May 26, 2005:
  • Opportunistic Orthogonal Writing on Dirty Paper
  • Pramod Viswanath, University of Illinois at Urbana-Champaign
  • Packard 202, 4:15-5:15 pm

• Thursday, June 2, 2005:
  • Stability of non-linear filters: some old and new surprises
  • Pavel Chigansky, Weizmann Institute of Science
  • Packard 202, 4:15-5:15 pm

• Thursday, September 1, 2005:
  • Network Quantum Shannon Theory
  • Jon Yard, School of Computer Science, McGill University
  • Packard 101, 4:15-5:15 pm

• Thursday, September 22, 2005:
  • On Fading MIMO Broadcast Channels with Imperfect Transmitter Side-Information
  • Amos Lapidoth, Swiss Federal Institute of Technology (ETH)
  • Packard 202, 4:15-5:15 pm