2007-2008 Schedule

• October 18, 2007
  • Information theory of wireless networks: A deterministic approach
  • David Tse, University of California, Berkeley
  • Packard 202

• October 25, 2007
  • Equi-energy sampling and its applications
  • Wing Hung Wong, Stanford University
  • Packard 202

• November 1, 2007
  • An information-theoretic view of stochastic resonance
  • Venkat Anantharam, University of California, Berkeley
  • Packard 202

• November 8, 2007
  • Dynamic spectrum allocation for uplink users with heterogeneous utilities
  • Roy Yates, Rutgers University
  • Packard 101

• November 15, 2007 *** joint seminar with AFLB (CS department) ***
  • Expander graphs, randomness extractors, and list-decodable codes
  • Salil Vadhan, Harvard University
  • Packard 101

• November 29, 2007
  • Statistical analysis of online news
  • Laurent El Ghaoui, University of California, Berkeley
  • Packard 101

• December 6, 2007
  • Exchanging limits: Why iterative decoding works
  • Rüdiger Urbanke, EPFL
  • Packard 101

• December 13, 2007
  • Wireless network security: Are we any safer now?
  • Srini Sampalli, Dalhousie University Halifax
  • Packard 101

• January 17, 2008
  • Sparse graphical codes: MAX-XORSAT, compression and binning
  • Martin Wainwright, University of California at Berkeley
  • Packard 202

• January 24, 2008
  • A factor-graph approach to universal channel coding
  • Pascal Vontobel, HP Labs
  • Packard 101

• January 31, 2008
  • On 3-receiver broadcast channel with degraded message sets: Indirect decoding and capacity theorems
  • Chandra Nair, Chinese University of Hong Kong
  • Packard 101

• February 7, 2008
  • Counter braids: An efficient counter architecture for measuring network traffic
  • Balaji Prabhakar, Stanford University
  • Packard 101

• February 14, 2008
  • Stability and asymptotic optimality of generalized MaxWeight policies
  • Sean Meyn, University of Illinois
  • Packard 101

• ***Friday*** February 22, 2008, 4:15pm
  • Cooperative wireless networking: from theory to practice
  • Elza Erkip, Polytechnic University
  • Packard 101

• February 28, 2008
  • Coding vs. queuing over multi-hop networks
  • Sanjay Shakkottai, University of Texas at Austin
  • Packard 101

• March 6, 2008
  • Finding minimum-rank matrices via nuclear norm minimization
  • Pablo Parrilo, MIT
  • Packard 101

• March 13, 2008
  • Estimation for color engineering: Adaptive neighborhoods and regularized local linear regression
  • Maya Gupta, University of Washington
  • Packard 202

• April 3, 2008
  • Fundamental bounds for physical-layer power consumption: "waterslide curves" and the price of certainty
  • Anant Sahai, Univeristy of California, Berkeley
  • Packard 101

• April 10, 2008
  • The Gaussian erasure channel: Theory and applications
  • Giuseppe Caire, USC
  • Packard 101

• April 17, 2008
  • Programming Informational Molecules: Synthetic DNA Circuits in a DNA World
  • Erik Winfree, Caltech
  • Packard 101

• April 24, 2008
  • Inventing public key cryptography. A fool's errand: v 2.1
  • Martin E. Hellman, Stanford University
  • Packard 101

• May 1, 2008, *** 2:00 pm ***
  • Hybrid and explicit model predictive control
  • Alberto Bemporad, Università di Siena
  • Packard 101

• *** Wednesday *** May 14, 2008, *** 2:00 pm ***
  • A bit of network information theory
  • Suhas Diggavi, EPFL
  • Packard 202

• May 15, 2008
  • Lossy compression via Markov Chain Monte Carlo
  • Tsachy Weissman, Stanford University and Technion
  • Packard 101

   

• May 22, 2008
  • Quantum state redistribution - an optimal approach to quantum source coding with quantum side information
  • John Yard, Los Alamos National Laboratory
  • Packard 101, 2:30 PM

• May 29, 2008
  • Erasure networks: Capacity, impact of feedback and secrecy
  • Sriram Vishwanath, University of Texas at Austin
  • Packard 101