ITA @ UCSD - ITA Workshop

Year

Monday

8:30	Continental breakfast

	Lossy source coding	List decoding and Reed-Solomon codes	MIMO I	Network coding
	Chair: David Neuhoff, University of Michigan	Chair: Farzad Parvaresh, Caltech	Chair: Michael Honig, Northwestern	Chair: Muriel Medard, MIT
9:00	On the Gaussian K-description problem under symmetric distortion constraints Chao Tian, AT&T Labs, Soheil Mohajer and Suhas N. Diggavi, EPFL	Error exponents of erasure/list decoding revisited via analysis of distance enumerators Neri Merhav, Technion, and Anelia Somekh-Baruch, Princeton	Nonlinear precoding for MIMO channels: analysis and convex design Ralf R. Muller, Norwegian University of Science and Technology, and Dongning Guo, Northwestern, and Aris Moustakas, National and Kapodistrian University of Athens	Iterative coding for network coding Andrea Montanari, Stanford, Vishwambar Rathi, EPFL, and Rudiger Urbanke, EPFL
9:20	Near lossless source coding with side information at the decoder: beyond conditional entropy En-hui Yang, University of Waterloo and Da-ke He, IBM TJ Watson Research	Non-binary LDPC codes vs. Reed-Solomon codes Bo Zhou, Li Zhang, Jingyu Kang, Qin Huang, Ying Y. Tai, Shu Lin, UC Davis, and Meina Xu, NGST	MIMO transceiver design via majorization theory: from linear to DF schemes Daniel P. Palomar, HKUST	On the insufficiency of linear solutions for the index coding problem Salim El Rouayheb, Alex Sprintson, and Costas Georghiades, Texas A&M
9:40	On rate-distortion function of Poisson processes with a queueing distortion measure Todd P. Coleman, UIUC, and Negar Kiyavash, UIUC, and Vijay G. Subramanian, Hamilton Institute, NUIM	Soft/list RS decoding: an overview Gottfried Ungerboeck, Broadcom	Subspace beamforming for near-capacity MIMO performance Sirikiat Lek Ariyavisitakul, Joonsuk Kim, Jun Zheng, and Nambi Seshadri, Broadcom	On the throughput-delay trade-off in mobile ad hoc networks implementing network coding Zhenning Kong, Yale, Emina Soljanin, Bell Labs, and Edmund Yeh, Yale
10:00	Optimal multiple description and multiresolution scalar quantizer design Michelle Effros, Caltech	VLSI architecture design for soft-decision Reed-Solomon decoding Xinmiao Zhang, Case Western	MIMO field performance Harris Teague and Chirag Patel, Qualcomm	Network tomography via network coding G. Sharma, IIT Bombay, S. Jaggi, CUHK, and B. K. Dey IIT Bombay
10:20	Break

	Distributed source coding	Algebraic and combinatorial coding theory	MIMO II	Network capacity I
	Chair: Tom Cover, Stanford	Chair: Paul Siegel, UCSD	Chair: Bhaskar Rao, UCSD	Chair: Aria Nosratinia, UT Dallas
10:50	A continuity theorem and its application to Gaussian network source coding problems Jun Chen, McMaster University, and Aaron B. Wagner, Cornell	Coding theory in projective spaces Tuvi Etzion, Technion, and Alexander Vardy, UCSD	Orthogonalizing a random set of beams Bert Hochwald and Harold Artes, Beceem Communications	Non-equilibrium information theory for ad hoc networks Jeffrey Andrews, UT Austin
11:10	The supremum sum-rate loss of quadratic Gaussian direct multiterminal source coding Yang Yang and Zixiang Xiong, Texas A&M	A note on Kloosterman sums and its application Ian F. Blake, University of British Columbia and Theo Garefalakis University of Crete	Impact of spatial correlation on limited feedback techniques Vasanthan Raghavan, Che Lin, and Venu V. Veeravalli, UIUC	Beyond linear capacity scaling in wireless networks Si-Hyeon Lee and Sae-Young Chung, KAIST
11:30	Error exponents and test channel optimization for the Wyner-Ziv problem Benjamin Kelly and Aaron B. Wagner, Cornell	Optimal interleaving for generalized concatenation Mario Blaum, Hitachi, Jorge Campello de Souza, Ksenija Lakovic and Bruce Wilson, Hitachi, and Shaohua Yang, LSI Logic	On multiuser interference cancellation for MIMO users Hamid Jafarkhani, UC Irvine	On capacity scaling in arbitrary wireless networks Urs Niesen, MIT, Piyush Gupta, Bell Labs, and Devavrat Shah, MIT
11:50	A relay-assisted distributed source coding problem Prakash Ishwar, Boston University and S. Sandeep Pradhan, University of Michigan	Isoperimetric Pareto-optimality on the hexagonal grid Daniel Vainsencher and Alfred M. Bruckstein, Technion	Multicode MIMO systems for hotspot area Jae-Dong Yang, Xianglan Jin, Kyoung-Young Song, Jong-Seon No, and Dong-Joon Shin, Seoul National University	Percolation processes and wireless network resilience Zhenning Kong and Edmund M. Yeh, Yale
12:10	Lunch

		Open problems	David Slepian memorial session
		Chair: Alexander Vardy, UCSD	Chair: Jack Wolf, UCSD
1:25		Closed-form expression for the parameters of binary lexicodes Ari Trachtenberg, Boston University Minimum distance bounds for expander codes Vitaly Skachek, University College Dublin	Ad memoriam Tom Cover, Dave Forney, Andrew Viterbi, and Jack Wolf
1:45		Asymptotic ensemble enumerators for protograph-based generalized LDPC codes: computational complexity Shadi Abu-Surra, William E. Ryan, and Dariush Divsalar, JPL Can the Storage Capacity of Memories Built from Unreliable Components Be Determined? Shashi Kiran Chilappagari, Bane Vasic, and Michael Marcellin	Lucas, Markov, Shannon, Sierpinski and the end of the world Toby Berger, University of Virginia
2:05		On the Spectrum of Large Random Hermitian Finite-Band Matrices Oren Somekh, Osvaldo Simeone, Benjamin M. Zaidel, H. Vincent Poor, and Shlomo Shamai (Shitz) The Entropy Photon-Number Inequality and its Consequences Saikat Guha, Baris I. Erkmen, and Jeffrey H. Shapiro	Canonical representations for multiterminal source coding Soumya Jana and Richard Blahut, UIUC
2:25	Break

	Communication Topics	LP decoding and LDPC codes	Communications I	Network capacity II
	Chair: Joerg Kliewer, New Mexico State	Chair: Ruediger Urbanke, EPFL	Chair: James Zeidler, UCSD	Chair: Piyush Gupta, Bell Labs
2:40	A mutual information invariance approach to symmetry in discrete memoryless channels Bike Xie and Richard Wesel, UCLA	Interior-point algorithms for linear-programming decoding Pascal O. Vontobel, HP Labs	The compound Gaussian interference channel A. Raja, V. Prabhakaran, and P. Viswanath, UIUC	Achieving capacity in wireless erasure networks with feedback Babak Hassibi, Caltech, and Brian Smith, UT Austin
3:00	Scheduling and Pre-Conditioning in Multi-User MIMO TDD systems J. Jose, A. Ashikhmin, Bell Labs, P. Whiting, and S. Vishwanath	Complexity scaling of mixed-integer linear programming decoding Stark C. Draper, University of Wisconsin and MERL, and Jonathan S. Yedidia, MERL	Adaptive training for fading channels with feedback Manish Agarwal and Michael L. Honig, Northwestern	Information theoretic operating regimes of large ad hoc wireless networks Ayfer Ozgur, Ramesh Johari, David Tse, UC Berkeley, and Olivier Leveque
3:20	Information rates of multi-antenna systems with unknown fading Oliver Collins, Notre Dame, Krishnan Padmanaban, and Sundeed Venkataman	An improved sphere-packing bound for finite-length codes over symmetric memoryless channels Gil Wiechman and Igal Sason, Technion	Finite energy communication over wideband sparse multipath channels Gautham Hariharan and Akbar Sayeed, University of Wisconsin	Interference alignment and the capacity of wireless networks Syed Jafar, Viveck Cadambe, and Krishna Gomadam, UC Irvine
3:40	The marginal utility of additional sensors Yu-Ching Tong and Gregory J. Pottie, UCLA	LDPC decoder strategies for achieving low error floors Yang Han and William E. Ryan, University of Arizona	Design and analysis of pilot-assisted distributed co-phasing algorithms for dense wireless sensor networks Ramesh Annavajjala, ArrayComm	Closing the capacity gap in wireless ad hoc networks using multi-packet reception Zheng Wang, Hamid R. Sadjadpour, UCSC, and JJ Garcia-Luna-Aceves
4:00	Break

	Source-channel coding	Communication topics	Communications II	Secrecy I
	Chair: Edmund Yeh, Yale	Chair: Tom Richardson, Qualcomm	Chair: Hamid Jafarkhani, UC Irvine	Chair: Vincent Poor, Princeton
4:30	Wyner-Ziv coding over broadcast channels Jayanth Nayak and Ertem Tuncel, UC Riverside, and Deniz Gunduz, Princeton	Electronic equalization of fiber optic links Andrew Singer, UIUC	Linear universal decoding for compound channels: an Euclidean geometric approach Emmanuel Abbe and Lizhong Zheng, MIT	Secrecy when the relay is the eavesdropper Xiang He and Aylin Yener, Penn State
4:50	Layered source-channel coding: a distortion-diversity perspective Sheng Jing, Lizhong Zheng, and Muriel Medard, MIT	Orthogonal codes for robust low-cost communication Wenyi Zhang and Urbashi Mitra, USC	On information theoretic aspects of single- and multi-carrier communications Michele Franceschini, Riccardo Pighi, Gianluigi Ferrari, and Riccardo Raheli, University of Parma	Cooperation for secrecy in broadcast channels Ersen Ekrem and Sennur Ulukus, University of Maryland
5:10	Coding and common knowledge Yossef Steinberg, Technion	A note on convergence rate of constrained capacity estimation algorithms over ISI channels Tolga M. Duman and Junshan Zhang, Arizona State	Asymptotic capacity of underspread and overspread stationary time- and frequency-selective channels Umer Salim and Dirk Slock, Eurecom Institute	Scheduling of secure broadcast Yingbin Liang, University of Hawaii, H. Vincent Poor, Princeton, and Lei Ying, Iowa State
5:30	Zzzzz

Tuesday

8:30	Continental breakfast

	Multiple access	Message passing and belief propagation	MIMO III	Secrecy II
	Chair: Roberto Padovani, Qualcomm	Chair: Dave Forney, MIT	Chair: Ramesh Annavajjala, Mitsubishi Electric	Chair: Sirin Tekinay, NSF
9:00	Joint multi-cell processing for downlink with limited-capacity backhaul S. Shamai (Shitz), Technion, O. Simeone, NJIT, O. Somekh, Princeton, and H. V. Poor, Princeton	Exactness of belief propagation for some graphical models with loops Michael Chertkov, Los Alamos	Adaptive feedback rate control in MIMO broadcast systems with user scheduling Randa Zakhour and David Gesbert, Eurecom Institute	Cyber-enabled discovery and innovation Sirin Tekinay, NSF
9:20	Cellular systems with multicell processing and conferencing links between mobile stations O. Simeone, NJIT, O. Somekh, Princeton, G. Kramer, Bell Labs, H. V. Poor, Princeton, and S. Shamai (Shitz), Technion	Clustering in message-passing schemes Sekhar Tatikonda, Yale	Multi-user diversity vs. channel feedback: is accurate channel feedback from a few users preferable to coarse feedback from many users? Niranjay Ravindran and Nihar Jindal, University of Minnesota	The secrecy graph and some of its properties Martin Haenggi, Notre Dame
9:40	Single-slot capacity of random access over a Gaussian MAC Onkar Dabeer, Tata Institute of Fundamental Research	Capacity-approaching practical codes for queueing channels: an algebraic, state-space, message-passing approach Todd P. Coleman and Negar Kiyavash, UIUC	On resource allocation in two-way limited feedback beamforming systems Chun Kin Au-Yeung and David J. Love, Purdue	Secure source compression with side information Deniz Gunduz, Princeton, Elza Erkip, Polytechnic University, and H. Vincent Poor, Princeton
10:00	On the structure of the capacity region of asynchronous memoryless multiple-access channels Ninoslav Marina, UH Manoa, and Bixio Rimoldi, EPFL	A message-passing solver for linear systems Ori Shental, UCSD, Danny Bickson, Hebrew University, Paul H. Siegel, UCSD, Jack K. Wolf, UCSD, and Danny Dolev, Hebrew University	Opportunistic scheduling and beamforming schemes for MIMO-SDMA downlink systems with linear combining Man-On Pun, Princeton, Visa Koivunen, HUT, and H. Vincent Poor, Princeton	Coding schemes for confidential communications Xiaojun Tang, Ruoheng Liu, Predrag Spasojevic, Rutgers, and H. Vincent Poor, Princeton
10:20	Break

	Broadcast channel/network	Iterative coding/decoding	Communications III	Secrecy III
	Chair: Young-Han Kim, UCSD	Chair: Alexander Vardy, UCSD	Chair: John Proakis, UCSD	Chair: Yingbin Liang, Princeton
10:50	The pre-log of Gaussian broadcast with feedback can be two Michael Gastpar, UC Berkeley, and Michele Wigger, ETH Zurich	Adaptive rateless coding under partial information S. Agarwal, Deutsche Telekom, and A. Hagedorn and A. Trachtenberg, Boston University	Source coding diversity and multiplexing strategies for a 2X2 MIMO system Marco Zoffoli and Jerry Gibson, UCSB, and Marco Chiani, University of Bologna	Secret communication over interference channels Roy Yates, Rutgers, David Tse, UC Berkeley, and Zang Li, Rutgers
11:10	Some recent results in broadcast channels for 2 and more receivers Vincent Wang, CUHK, Chandra Nair, CUHK, and Abbas El Gamal, Stanford	The price of certainty: iterative decoding from a total power perspective Anant Sahai, UC Berkeley	MultiGigabit millimeter wave communication: system concepts and challenges Upamanyu Madhow, UCSB	A channel-enhancement approach to the secrecy capacity of the multi-antenna wiretap channel Tie Liu, Texas A&M, and Shlomo Shamai (Shitz), Technion
11:30	On the capacity of fading broadcast channels Amin Jafarian, Jubin Jose, and Sriram Vishwanath, UT Austin	On the error tolerance of iterative decoder circuitry On Wa Yeung and Keith M. Chugg, USC	Capacity limits and performance results for frequency-hop transmission over partial-band noise channels Michael B. Pursley and Thomas C. Royster IV, Clemson University	Communication graphs, key graphs, and Harary graphs Yvo Desmedt, London University, Henk van Tilborg, Technical University, Eindhoven, and Huaxiong Wang, Nanyang Technological University
11:50	Network coding on lines, stars, and rings Gerhard Kramer, Bell Labs, Sadegh Tabatabaei Yazdi, and Serap Savari	Gaussian mixture reduction by L_2-norm minimization, with applications to lattice decoding Brian Kurkoski, University of Electro-Communications and Justin Dauwels, RIKEN	Another look at the Poltyrev exponent Venkat Anantharam, UC Berkeley, and Francois Baccelli, ENS, Paris	On secure communication using sources and channels: a separation result Vinod Prabhakaran and Kannan Ramchandran, UC Berkeley
12:10	Lunch

1:25	Who wants to be a researchaire? Ruediger Urbanke, EPFL

2:25	Break

	Interference and relay channels	Coding for wireless communications	Cognitive radios/networks I	Universal coding
	Chair: Giuseppe Caire, USC	Chair: Bruce Moision, JPL	Chair: Michael Pursley, Clemson University	Chair: Alon Orlitsky, UCSD
2:40	Progresses on Gaussian interference channels with and without generalized feedback Daniela Tuninetti, University of Illinois at Chicago	Reduction of ML decoding complexity for MIMO sphere decoding, QOSTBC, and OSTBC L. Azzam and E. Ayanoglu, UC Irvine	Power control for cognitive radios: how to cross a multi-lane highway Wei Ren and Qing Zhao, UC Davis, and Ananthram Swami, ARL	Pattern entropy - revisited Gil I. Shamir, University of Utah
3:00	Sum capacity of the Gaussian interference channel in the low interference regime V. Sreekanth Annapureddy and Venugopal V. Veeravalli, UIUC	Multi-hop cooperative wireless networks: diversity multiplexing tradeoff and optimal code design K. Sreeram, S. Birenjith, IISc and P. Vijay Kumar, IISc and USC	Recent results on cognitive radio Ivana Maric and Andrea Goldsmith, Stanford, Gerhard Kramer, Bell Labs, and Shlomo Shamai (Shitz), Technion	Lossless compression for sparse finite memory sources Gadiel Seroussi, HP Labs and Universidad de la Rep�blica, Uruguay
3:20	On information flow over wireless relay networks S. Avestimehr, UC Berkeley, S. N. Diggavi, EPFL, and D. Tse, UC Berkeley	Near-optimum STBC/SFBC using 1-bit feedback for the 4-transmit antenna system Joonsuk Kim, Sirikiat Lek Ariyavisitakul, and Nambi Seshadri, Broadcom	The application of distributed spectrum sensing and available resource maps to cognitive radio systems Claudio R. C. M. da Silva, William C. Headley, Jesse D. Reed, and Youping Zhao, Virginia Tech	Collaborative compression Krishnamurthy Viswanathan and Ram Swaminathan, Hp Labs
3:40	Some results on relay strategies for memoryless two-way relay channels Tao Cui and Tracey Ho, Caltech, and Joerg Kliewer, New Mexico State University	On the complexity of lattice precoding algorithms for multiuser broadcast Cong Ling, Imperial College	Rate allocation in multiuser cognitive radio systems with successive group decoding Narayan Prasad, NEC Labs and Xiaodong Wang, Columbia	Prediction and modeling with partial dependencies Tjalling Tjalkens, Technical University, Eindhoven
4:00	Break

	Wireless and wireline networks	Convolutional and repeat-accumulate codes	Cognitive radios/networks II	Compression and language
	Chair: Jim Omura, Moore Foundation	Chair: Ori Shental, Tel Aviv University	Chair: Larry Milstein, UCSD	Chair: Jeffrey Vitter, Purdue
4:30	Coalitions in cooperative wireless networks Suhas Mathur, Rutgers, Lalitha Sankar, Princeton, and Narayan B. Mandayam, Rutgers	Spectra and minimum distances of multiple repeat-accumulate codes Fabio Fagnani and Chiara Ravazzi, Politecnico di Torino	Self-organizing networks and the road to cognitive networks Luiz DaSilva, Virginia Tech	On searching compressed string collections cache obliviously Jeffrey Vitter, Purdue
4:50	Maximizing reliability in multi-hop wireless networks with cascaded space-time codes Rahul Vaze and Robert W. Heath Jr., UT Austin	On the distance growth properties of double serially concatenated convolutional codes Daniel Costello, Notre Dame, Christian Koller, Joerg Kliewer, and Kamil Zigangirov	Partially coherent channels Behnaam Aazhang and Christopher Steger, Rice	High-resolution functional quantization Vinith Misra, Vivek K Goyal, and Lav R. Varshney, MIT
5:10	On the throughput of acyclic wired packet networks with finite buffers Badri N. Vellambi and Faramarz Fekri, Georgia Tech	A truncation-depth rule of thumb for convolutional codes Bruce Moision, JPL	Channel state feedback schemes for MIMO-OFDM downlink Giuseppe Caire and Hooman Shirani-Mehr, USC	Combinations of context-free shifts and shifts of finite type Hiroshi Kamabe, Gifu University
5:30	Zzzzzzz

Wednesday

8:30	Continental breakfast

9:00	Graduation-day presentations

	Codes for identification and communication	Shannon theory I	Wireless communications
	Chair: Frank Kschischang, University of Toronto	Chair: Gregory Wornell, MIT	Chair: Shlomo Shamai (Shitz), Technion
9:00	Localization and identification in networks using robust identifying codes Moshe Laifenfeld, Boston University	Optimal real-time encoding and decoding of Markov sources over noisy channels Aditya Mahajan and Demosthenis Teneketzis, University of Michigan	MIMO communications with feedback Che Lin, UIUC and Venugopal V. Veeravalli
9:25	Nonlinear turbo codes: even closer to Shannon capacity Miguel Griot, Andres I. Vila Casado, and Richard D. Wesel, UCLA	Finite state channels with and without feedback via directed information Haim H. Permuter, Stanford	Limited feedback performance for frequency-selective block fading channels Manish Agarwal, Dongning Guo, and Michael Honig, Northwestern
9:50	Opportunistic codes for broadband (ISI) channels Sanket Dusad and Suhas Diggavi, EPFL, and Robert Calderbank, Princeton	Unequal error protection: some fundamental limits and optimal strategies Shashi Borade, Baris Nakiboglu, Lizhong Zheng (MIT)	On the delay-sensitive communication over wireless systems Lingjia Liu and Jean-Francois Chamberland, Texas A&M
10:15	Optimization-based approaches to decoding linear codes Mohammad H. Taghavi and Paul H. Siegel, UCSD	Outer bounds and noisy-interference sum-rate capacity for multi-user Gaussian interference channels Xiaohu Shang, Syracuse, Gerhard Kramer, Bell-Labs, and Biao Chen, Syracuse	A spectrum-shaping perspective on cognitive radio Wenyi Zhang, USC
10:40	Break

	Algorithms for information processing	Shannon theory II	Wireless relay networks
	Chair: Gerhard Kramer, USC	Chair: Toby Berger, University of Virginia	Chair: Urbashi Mitra, USC
10:55	Learning mixtures of transformations for classification Andrew Howard, Columbia	Topics in multi-terminal progressive coding Alina Maor and Neri Merhav, Technion	Wireless relay networks: deterministic modeling and capacity approximation Salman Avestimehr, UC Berkeley
11:20	Distributed algorithms for large-scale information processing and storage Alex Dimakis, UC Berkeley	On anonymity in networking Parv Venkitasubramaniam, Cornell	Beamforming in wireless relay networks Yindi Jing and Hamid Jafarkhani, UC Irvine
11:45	Algorithms for information theory WeiHsin Gu, Caltech	Secret key distribution using source and channel coding techniques Ashish Khisti, MIT	Non-regenerative relaying in mesh networks Oren Somekh, Princeton, Osvaldo Simeone, NJIT, H. Vincent Poor, Princeton, and Shlomo Shamai (Shitz), Technion
12:10	Lunch

1:20	Keynote presentation:Sparse sampling: variations on a theme by Shannon Martin Vetterli, EPFL

2:40	Social event: Salk Institute

7:00	Banquet, UCSD Faculty Club *** IT was never so much fun

Thursday

8:30	Continental breakfast

	Resource allocation	Probability and control	1:20 hour tutorial	Sensor networks
	Chair: Martin Haenggi, Notre Dame	Chair: Kenneth Kreutz-Delgado, UCSD	Chair: Fan Chung-Graham, UCSD	Chair: Jean-Francois Chamberland, Texas A&M
9:00	On throughput-optimal scheduling with delayed channel state feedback Lei Ying and Sanjay Shakkottai, UT Austin	Constrained coalitional games with applications to information and communication systems John S. Baras, University of Maryland	Compressed sensing Emmanuel Candes, Caltech	Reaching consensus about gossip: convergence times and costs Florence B�n�zit, EPFL, Patrick Denantes, EPFL, Georgios Alexandros Dimakis, UC Berkeley, Patrick Thiran, EPFL, and Martin Vetterli, EPFL
9:20	Efficiency bounds for sequential wireless resource allocation auctions J. Bae, E. Beigman, R. Berry, M. Honig, and R. Vohra, Northwestern	On the connections between information and estimation theory: from AWGN channels to dynamical systems with feedback Francisco J. Piera and Patricio Parada, University of Chile		The decentralized estimation officers problem Mehmet Ercan Yildiz, Can Aysal, and Anna Scaglione, Cornell
9:40	Dynamic rate allocation in fading multiple-access channel Ali Parandehgheibi, Atilla Eryilmaz, Asuman Ozdaglar, MIT, and Muriel Medard	On the detection of information flow via timing analysis Ting He, IBM, and Lang Tong, Cornell		Robust sensor network localization via composite hypothesis testing Yannis Paschalidis, Boston University
10:00	A Coalition game model for spectrum pooling in wireless data access networks Saswati Sarkar, Upenn, Chandramani Singh and Anurag Kumar, IISc	Queue-based codes for timing channels Pierre Moulin, UIUC		Algebraic topological methods for decentralized coverage verification and intruder detection in sensor networks Ali Jadbabaie, UPenn
10:20	Break

	Network algorithms and analysis	Control and communications	1:20 hour tutorial	Machine learning I
	Chair: Balaji Prabhakar, Stanford	Chair: Massimo Franceschetti, UCSD	Chair: Bhaskar Rao, UCSD	Chair: Kamalika Chaudhuri, UCSD
10:50	A game-theoretic model for medium access control Lijun Chen, Tao Cui, Steven Low, and John Doyle, Caltech	On robotic coordination with limited information Francesco Bullo and Ruggero Carli, UCSB	Signal processing for integrative bioinformatics Al Hero, University of Michigan	STAIR: the STanford Artificial Intelligence Robot project Andrew Y. Ng, Stanford
11:10	On the delay optimality of proportional fairness Lei Ying, Iowa State University, Bo Tan and R. Srikant, UIUC	Distributed optimal control under markovian erasure channels Bruno Sinopoli, Carnegie Mellon University and Emanuele Garone, Universita della Calabria		Approximating the partition function by deleting and then correcting for model edges Arthur Choi and Adnan Darwiche, UCLA
11:30	Message passing algorithms a new class of efficient methods for large-scale networks Mohsen Bayati, Microsoft, Devavrat Shah, MIT, and Mayank Sharma, IBM	Connections between Consensus, Formation Control and the Statistical Mechanics of Harmonic Solids Bassam Bamieh, UCSB, Partha Mitra, Mihailo Jovanovic, and Stacy Patterson		On line learning in Markov decision processes with arbitrarily varying rewards S. Mannor, McGill, J.Y. Yu, and N. Shimkin
11:50	Counter braids: a sparse graph, message passing counter architecture Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang Dharmapurikar, and Abdul Kabbani, Stanford University and Nuova Systems	Erogodic capacity maximing precoder design for MIMO ARQ system using imperfect channel information Zhi Ding, UC Davis and River Huang		Embedding and b-matching of weighted graphs and data Tony Jebara, Columbia
12:10	Lunch

	Communication networks I	Neuroscience and bioinformatics	Compressed sensing I	Machine learning II
	Chair: Andrew McGregor, UCSD	Chair: Sharon Aviran, UC Berkeley	Chair: Emmanuel Candes, Caltech	Chair: Sanjoy Dasgupta, UCSD
1:25	Effective capacity for mobile multicast over fading channels in wireless networks Xi Zhang, Texas A&M and Qinghe Du	Computational design of the olfactory system Ramon Huerta, UCSD and Thomas Nowotny, U. Sussex	Sequential compressed sensing Dmitry Malioutov, Sujay Sanghavi, MIT, and Alan Willsky	Sparse regression as a sparse eigenvalue problem Baback Moghaddam, Caltech, Amit Gruber and Yair Weiss, Hebrew University, and Shai Avidan, Adobe Systems Inc.
1:45	Dynamic decentralized multi-channel MAC protocols H. Seferoglu, UC Irvine, A. Lakshmikantha, UIUC, A. Ganesh, University of Bristol, and P. Key, Microsoft	Neural architectures for sparse approximation Christopher Rozell, UC Berkeley, Don Johnson, Richard Baraniuk, and Bruno Olshausen	Compressed sensing and linear codes over real numbers Fan Zhang and Henry D. Pfister, Texas A&M	Bayesian network structure learning using factorized NML universal models Teemu Roos, Tomi Silander, Petri Kontkanen, and Petri Myllym�ki, University of Helsinki
2:05	LDP for max-weight scheduling over convex compact rate-regions Vijay G. Subramanian, National University of Ireland, Maynooth	Bayesian signal processing for cancer diagnosis using mass spectrometry data Jianqiu Zhang, Lin Zhang, Honghui Wang, Anthony Suffredini, Denise Gonzales, Yufei Huang, and Xiaobo Zhou, UT San Antonio	Learning compressed sensing Yair Weiss, Hebrew University, Hyun Sung Chang, MIT, and William T. Freeman, MIT	Learning sparse graphical models Narayana Santhanam, UC Berkeley, and Martin Wainwright
2:25	Break

	Networks with constrained resources	Bioinformatics I	Compressed sensing II	Machine learning III
	Chair: Ravi Mazumdar, University of Waterloo	Chair: Olgica Milenkovic, UIUC	Chair: Yoram Bresler, UIUC	Chair: Yoav Freund, UCSD
2:40	On the maximum number of simultanesou links in a random multi-hop network with fading Hengameh Keshavarz, Ravi R. Mazumdar, and Liang-Liang Xie, University of Waterloo	Relative expression analysis for cancer diagnosis and prognosis Nathan Price, UIUC	Algorithms and Bounds for Sensing Capacity and Compressed Sensing M. Zhao, S. Aeron, V. Saligrama	Learning structure and dependencies in high-dimensional data Sayan Mukherjee, Duke
3:00	Robust adaptive wireless communication using ARQ-feedback C. Emre Koksal, OSU	Designing Synthetic Biological Networks for Microbial Biofuel Production Desmond S. Lun, Broad Institute of MIT and Harvard	Constrained compressed sensing via superimposed coding Wei Dai and Olgica Milenkovic, UIUC	An information-theoretic derivation of graph partitioning Chris Wiggins, Columbia
3:20	On power-of-choice in downlink transmission scheduling Murat Alanyali and Maxim Dashouk, Boston University	Activity motif analysis of the function of biological networks Gal Chechik, Google, Aviv Regev, Daphne Koller	Combining geometry and combinatorics: A unified approach to sparse signal recovery A.C. Gilbert, University of Michigan, P. Indyk, H. Karloff, M.J. Strauss	Learning hidden factor models for network tomography I. Rish, IBM and G. Chandalia
3:40	Achievable rate region and optimality of multi-hop wireless 802.11-scheduled networks Apoorva Jindal and Konstantinos Psounis, USC	Reverse engineering of gene regulatory networks via iterative list decoding Janis Dingel, TUM and Olgica Milenkovic, UIUC	Fast Bayesian matching pursuit Phil Schniter and Lee C. Potter, OSU	Boosting the area under the ROC curve Philip M. Long, Google, and Rocco A. Servedio, Columbia
4:00	Break

	Optimization and learning	Learning and signal processing	Compressive sensing	Machine learning IV
	Chair: Ruth Williams, UCSD	Chair: Nuno Vasconcelos, UCSD	Chair: Richard Baraniuk, Rice	Chair: Charles Elkan, UCSD
4:30	Shannon meets Bellman: feature based Markovian models for detection and optimization S. Meyn, UIUC and G. Mathew and E. Scholte UTRC	Discriminative and generative machine learning approaches towards robust phoneme classification Jibran Yousafzai, Matthew Ager, Zoran Cvetkovic, Peter Sollich, King's College London	Iterative signal recovery from incomplete and inaccurate measurements J. Tropp, D. Needell, and R. Vershynin, Caltech	Error correcting tournaments for multiclass classification John Langford, Yahoo Research, Alina Beygelzimer, and Pradeep Ravikumar
4:50	On robustness of classifiers Xu Huan and Shie Mannor, McGill University, and Constantine Caramanis, UT Austin	Fuzzy logic decision fusion for multimodal biometric authentication Helen Mei-Ling Meng, CUHK	Compressed channel sensing R. Nowak, University of Wisconsin, W. Bajwa, and J. Haupt	Socio-molecular predictors of health and disease Patrick Harrington, Arvind Rao, Peter Woolf, and Alfred Hero, University of Michigan
5:10	Optimal causal quantization of Markov Sources with distortion constraints Serdar Yuksel, Queen's University, Tamer Basar and Sean P. Meyn, UIUC	From information scaling of images to regimes of statistical models Ying Nian Wu, UCLA	Compressive learning and inference Richard Baraniuk, Rice, Chinmay Hegde, Marco Duarte, Mark Davenport, and Michael Wakin
5:30	Zzzzzzz

Friday

8:30	Continental breakfast

	Network economics	Signal processing	1:20 hour tutorial	Machine learning V
	Chair: Tara Javidi, UCSD	Chair: Pierre Moulin, UIUC	Chair: Nuno Vasconcelos, UCSD	Chair: Virginia de Sa, UCSD
9:00	Pricing competition for queued services with multiple providers Rahul Jain and Parijat Dube, IBM and Corinne Touati, INRIA	Spectrum-blind sampling and compressive sensing for continuous-index signals Yoram Bresler, UIUC	Visual recognition: why, how, when Pietro Perona, Caltech	Learning max-weight discriminative forests John Fisher, Vincent Tan, and Alan Willsky, MIT
9:20	Efficiency loss in differentiated services pricing Shuang Wu and John Musacchio, UCSC	Generalized periodic non-uniform sampling of non-bandlimited signals Chen Meng and Jamal Tuqan, UC Davis		Learning mixtures of distributions using correlations and independence Kamalika Chaudhuri, UCSD, and Satish Rao, UC Berkeley
9:40	Resource management for content distribution on the internet Srinivas Shakkottai and Ramesh Johari, Stanford	Tree-based majorize-minimize algorithm for signal reconstruction with sparse-yree prior Minh N. Do, UIUC and Chinh N. H. La		Declaring independence via the sketching of sketches Piotr Indyk, MIT, and Andrew McGregor, UCSD
10:00	Nash implementation for resource allocation network problems with production Tudor M. Stoenescu, JPL, and John Ledyard, Caltech	On sequential analog-to-digital conversion with low-precision components Hans-Andrea Loeliger, ETH, Zurich		Universal probability assignment with finite memory Meir Feder, Tel Aviv University
10:20	Break

	Communications networks II	Bioinformatics II	1:20 hour tutorial	Communications
	Chair: Anders Nilsson Plymoth, UCSD	Chair: Eleazar Eskin, UCLA	Chair: Gert Lanckriet, UCSD	Chair: Narayana Prasad Santhanam, University of Hawaii at Manoa
10:50	Filtering sources of unwanted traffic Fabio Soldo, Karim El Defrawy, and Athina Markopoulou, UC Irvine, and Bala Krishnamurthy and Kobus van der Merwe, AT&T Research	Statistical models for aCGH data: applications to cancer genomics Kevin Murphy and Sohrab Shah, University of British Columbia	We are drowning in multimedia data. Hurray! Malcolm Slaney, Yahoo Research	Generalized modulation Christian Schlegel, University of Alberta
11:10	Explicit and precise rate control in wireless sensor networks Avinash Sridharan and Bhaskar Krishnamachari, USC	The neighbor-net algorithm and the traveling salesman problem Lior Pachter, UC Berkeley		Buffering requirements for variable-iterations LDPC decoders Sarah L. Sweatlock, Sam Dolinar, JPL, and Kenneth Andrews
11:30	Local pooling conditions for joint routing and scheduling Andrew Brzezinski, Fidelity Investments, Gil Zussman, Columbia, and Eytan Modiano, MIT	Computational and statistical challenges in the design of genetic association studies Eleazar Eskin, UCLA		Recursive Analysis of Ad Hoc Networks with Packet Queueing, Channel Contention and Hybrid ARQ Marco Levorato, University of Padova, Stefano Tomasin, University of Padova, Michele Zorzi, UCSD
12:10	Lunch

1:00	Post-workshop short course

			Compressive sensing

1:00			Theory of compressive sensing: signal reconstruction algorithms Richard Baraniuk, Rice
2:00			From reconstruction to compressive signal processing Justin Romberg, Georgia Tech
3:00			Applications of compressive sensing Michael Wakin, University of Michigan