2003/2004 Schedule

• Monday, October 6, 2003:
  • Last Encounter Routing
  • Matthias Grossglauser, EPFL
  • Packard 202, 4:15-5:15 pm
• Thursday, October 30, 2003:
  • Distributed Compression: Applications To Distributed Sensor Networks And A New Video-Over-Wireless Paradigm
  • Kannan Ramachandran, UC Berkeley
  • Packard 101, 4:15-5:15 pm
• Thursday, November 6, 2003:
  • When Network Theorists Think Like Leeches
  • Greg Wornell, MIT
  • Packard 101, 4:15-5:15 pm
• Thursday, November 13, 2003:
  • Capacity Of Ultra Wide Band Systems With Spreading Signals
  • Dana Porrat, UC Berkeley
  • Packard 101, 4:15-5:15 pm
• Wednesday, November 26, 2003:
  • Distributed Signal Processing With a Sensor Network
  • Tom Luo, University of Minnesota (Visitor ISL, Stanford University)
  • Packard 101, 4:15-5:15 pm
• Tuesday, December 2, 2003:
  • New Space-time Block Code Constructions and their Marriage to Multiple Trellis-Coded Modulation
  • Urbashi Mitra, USC
  • Packard 101, 4:15-5:15 pm
• Thursday, January 22, 2004:
  • From 2 to Infinity: Information Theory of Large Alphabets
  • Alon Orlitsky, UCSD
  • Packard 202, 4:15-5:15 pm
• Thursday, January 29, 2004:
  • Channel Shortening for Multicarrier Systems
  • Conor Heneghan, University College Dublin
  • Packard 101, 4:15-5:15 pm
• Thursday, February 12, 2004:
  • Efficient Variable Length Channel Coding for Unknown Discrete Memoryless Channels
  • Stark Draper, Unversity of Toronto
  • Packard 101, 4:15-5:15 pm
• Thursday, February 19, 2004:
  • Some Classes of Stationary Processes and their On-line Detection
  • Benjamin Weiss, Hebrew University
  • Packard 101, 4:15-5:15 pm
• Thursday, March 4, 2004:
  • Cost-Distortion-Optimal Communication Via Measure-Matching: Key Ideas And Application To Neural Communication.
  • Bixio Rimoldi, EPFL
  • Packard 101, 4:15-5:15 pm
• Monday, March 8, 2004:
  • Connections between Estimation Theory and Information Theory
  • Sergio Verdu, Princeton University
  • Packard 101, 4:30-5:30 pm
• Thursday, March 25, 2004:
  • Randomization and Heavy Traffic Theory: New Approaches to the Design and Analysis of Switch Algorithms
  • Devavrat Shah, Stanford University
  • Packard 202, 4:15-5:15 pm
• Thursday, April 8, 2004:
  • Secret Key Generation and Multiterminal Source Coding
  • Prakash Narayan, University of Maryland
  • Packard 101, 4:15-5:15 pm
• Thursday, April 15, 2004:
  • Rate Control in Random Access Networks
  • Peter Marbach, University of Toronto
  • Packard 202, 4:15-5:15 pm
• Thursday, April 29, 2004:
  • Dynamic power control in a wireless channel subject to a quality of service constraint
  • Baris Ata, Kellogg School of Management
  • Packard 101, 4:15-5:15 pm
• Thursday, May 6, 2004:
  • Time Synchronization and Distributed Modulation in Large Sensor Networks (or "How to Make a Large Random Field by Stitching Together Very Many Small Ones")
  • Sergio D. Servetto, Cornell University
  • Packard 101, 4:15-5:15 pm
• Thursday, May 13, 2004:
  • Linear Time Universal Coding in the Class of Tree Models via FSM Closure
  • Marcelo Weinberger, HP Labs
  • Packard 202, 4:15-5:15 pm
• Thursday, May 20, 2004:
  • On Universal Types
  • Gadiel Seroussi, HP Labs
  • Packard 202, 4:15-5:15 pm
• Thursday, June 10, 2004:
  • Universal Minimax Discrete Denoising under Channel Uncertainty
  • Styrmir Sigurjonson, Stanford University
  • Packard 101, 4:15-5:15 pm