2005-2006 Schedule

• October 6, 2005
  • Raptor Codes
  • Abstract
  • Amin Shokrollahi, EPFL & Digital Fountain
  • Packard 101

• October 13, 2005
  • No talk scheduled.

• October 20, 2005
  • Gaussian Feedback Capacity
  • Abstract
  • Young-Han Kim, Stanford University
  • Packard 202

• October 27, 2005
  • Finite-SNR Diversity-Multiplexing Tradeoff for MIMO Fading Channels
  • Abstract
  • Ravi Narasimhan, UC Santa Cruz
  • Packard 202

• November 3, 2005
  • Cooperation in Wireless Networks and Capacity Results for Channels with Conferencing
  • Abstract
  • Ivana Maric, Rutgers University
  • Packard 202

• November 10, 2005
  • Scaling Laws for Random ad hoc Wireless Networks
  • Abstract
  • Olivier Leveque, EPFL
  • Packard 101

• November 17, 2005
  • A Universal Scheme for Learning
  • Abstract
  • Vivek Farias, Stanford University
  • Packard 101

• December 1, 2005
  • Quality Side Information, Compression and Belief Propagation
  • Abstract
  • Emin Martinian, Mitsubishi Electric Research Labs
  • Packard 101

• December 8, 2005
  • Cooperation in Wireless Channels
  • Abstract
  • Hesham El Gamal, Ohio State University
  • Packard 101

• December 15, 2005
  • Opportunistic Decoding: Maximizing Rate and Reliability in Channels With Feedback
  • Abstract
  • Stark Draper, UC Berkeley
  • Packard 101

• January 12, 2006
  • Source Coding with Limited Side Information Lookahead at the Decoder
  • Abstract
  • Tsachy Weissman, Stanford University
  • Packard 101

• January 19, 2006
  • Steganography: Art or Science?
  • Abstract
  • Pierre Moulin, University of Illinois at Urbana-Champaign
  • Packard 101

• January 26, 2006
  • Pallier Encryption Revisited
  • Abstract
  • Ton Kalker, HP Labs
  • Packard 101

• February 2, 2006
  • Special talk, 3-4pm in addition to regular talk
  • Signal Processing and Energy Efficiency in Wireless Networks
  • Abstract
  • Vince Poor, Princeton University
  • Packard 101, 3pm
  • Combinatorial Optimization: New Approaches and Proofs of Conjectures
  • Abstract
  • Chandra Nair, Microsoft
  • Packard 101, 4:15pm

• February 9, 2006
  • Message-Passing Algorithms for Constraint Satisfaction Problems
  • Abstract
  • Elitza Maneva, UC Berkeley
  • Packard 101

• February 16, 2006
  • Interacting Systems on Huge Random Structures: Problems, Algorithms, and Applications
  • Andrea Montanari
  • Packard 101

• February 23, 2006
  • Distributed Information and Statistical Inference
  • Emin Martinian, Mitsubishi
  • Packard 101

• March 2, 2006
  • Constrained Information Combining: Theory and Applications
  • Shlomo Shamai, Technion
  • Packard 101

• **Tuesday** March 7, 2006
  • Title & Abstract TBA
  • Pramod Viswanath, UIUC
  • Room TBA

• March 23, 2006
  • MIMO Wireless Communication
  • Daniel W. Bliss, MIT Lincoln Laboratory
  • Packard 101

• April 6, 2006
  • "Crystallization" in Large Fading Networks
  • Helmut Bolcskei, ETH
  • Packard 202

• April 27, 2006
  • Achieving Channel Capacity Against Malicious Errors
  • Venkatesan Guruswami, University of Washington
  • Packard 202

• May 11, 2006
  • Delay, feedback and the price of ignorance
  • Anant Sahai, UC Berkeley
  • Packard 101

• May 18, 2006
  • Probabilistic Models for Complex Domains: Cells, Bodies, and Webpages
  • Daphne Koller, Stanford
  • Packard 101

• May 25, 2006
  • An Information Theoretic Viewpoint to Performance Bounds of Feedback Systems
  • Nuno Martins, University of Maryland
  • Packard 101

• June 8, 2006
  • The Region of Achievable Rates for Multiterminal Source Coding
  • Sergio Servetto, Cornell
  • Packard 101