NASIT2009 Monday - Student Poster Presentations
Titles of posters presented on Monday 08/10 4-6pm
- Achaleshwar Sahai Ìý Rice University Ìý Feedback Strategies in Deterministic Interference Channel
- J inhua JiangÌýÌý ÌýStanford University Ìý Ìý Ìý Achievable Rate Regions for Broadcast Channels With Cognitive Relays
- Emrah AkyolÌýÌý ÌýUniversity of California, Santa BarbaraÌýÌý Ìý Optimal Mappings for Joint Source Channel Coding
- Songqing ZhaoÌýÌý ÌýUniversity of Illinois at ChicagoÌýÌý Distortion Exponent for Multiple Description Coding
- Jinhong WuÌýÌý ÌýGeorge Washington UniversityÌýÌý Ìý Partial Iterative Equalization and Channel Decoding
- Thomas CourtadeÌýÌý ÌýUCLAÌýÌý Ìý A Cross-Layer Perspective on Rateless Coding for Wireless Channels
- Danilo SilvaÌýÌý ÌýUniversity of TorontoÌýÌý Ìý Communication over Finite-Field Matrix Channels
- Satashu GoelÌýÌý ÌýCarnegie Mellon UniversityÌýÌý Ìý Analysis of Delay Statistics for the Queued-code
- Ozgun Y. BursaliogluÌýÌý ÌýUniversity of Southern CaliforniaÌýÌý Ìý Multicasting of Digital Images Over Erasure Broadcast Channels Using Rateless Codes
- Lav VarshneyÌýÌý ÌýMassachusetts Institute of TechnologyÌýÌý Ìý A Channel that Dies
- Nan MaÌýÌý ÌýBoston UniversityÌýÌý Ìý Bounds for Interactive Computation in Collocated Networks
- Aman JainÌýÌý ÌýPrinceton UniversityÌýÌý Ìý Multicasting in Large Random Wireless Networks: Bounds on the Minimum Energy per Bit
- Azadeh KhaleghiÌýÌý ÌýUniversity of TorontoÌýÌý Ìý Projective Space Codes for the Injection Metric
- Adnan RajaÌýÌý ÌýUniversity of Illinois, Urbana-ChampaignÌýÌý Ìý Reciprocity in Wireless Networks
- Jiening ZhanÌýÌý ÌýUniversity of California, BerkeleyÌýÌý Ìý Functional Forwarding of Channel State Information
- Kagan BakanogluÌýÌý ÌýPolytechnic Institute of NYUÌýÌý Ìý Resource Allocation for the Parallel Relay Channel with Multiple Relays
- M. AnandÌýÌý ÌýUniversity of Illinois at Urbana-ChampaignÌýÌý Ìý On approximating Gaussian Relay Networks by Deterministic Networks
- Matthew NoklebyÌýÌý ÌýRice UniversityÌýÌý Ìý Bargaining for Energy-efficient User Cooperation
- Ye TianÌýÌý ÌýPennsylvania State UniversityÌýÌý Ìý The Gaussian Interference Channel with a Potent Relay
- Jiadong WangÌýÌý ÌýUCLAÌýÌý Ìý Superposition Codes for Broadcast Binary Symmetric Channel
- Siva Theja MaguluriÌýÌý ÌýUniversity of Illinois Urbana ChampaignÌýÌý Ìý Bounds for capacity of Deletion Channel
- K V SrinivasÌýÌý ÌýUniversity of TorontoÌýÌý Ìý On Maximizing Mutual Information over Parallel Gaussian Channels with Discrete Input Signaling
- O. Ozan KoyluogluÌýÌý ÌýOhio State UniversityÌýÌý Ìý On the Role of Cooperation in Interference Channels for Physical Layer Secrecy
- Juyul LeeÌýÌý ÌýUniversity of MinnesotaÌýÌý Ìý Energy-efficient Policies for Finite-horizon Scheduling with Causal CSIT
- Bernd BandemerÌýÌý ÌýStanford UniversityÌýÌý Ìý Sum capacity of a Class of Cyclically Symmetric Interference Channels
- Vinodh VenkatesanÌýÌý ÌýEPFL, Switzerland / IBM Zurich Research LabÌýÌý Ìý Coding for Large-Scale Storage Systems
- Nabil Hajj ChehadeÌýÌý ÌýUCLAÌýÌý Ìý Adaptive Sampling and Model Selection
- Aly El GamalÌýÌý ÌýUniversity of Illinois, Urbana-ChampaignÌýÌý ÌýRandomization for Security in Half-Duplex Two-Way Gaussian Channels
- Tomas FillerÌýÌý ÌýSUNY BinghamtonÌýÌý Ìý The Square Root Law of Steganographic Capacity
- Lei ZhangÌýÌýÌýÌýNorthwestern UniversityÌýÌýÌýÌý Compressed Neighbor Discovery for MANETs
Ìý
Ìý
Ìý
Ìý
Ìý
Ìý