AG-69

Refined Approaches to Randomized Rounding

Speaker: 

<p>Nikhil Bansal<br /> Eindhoven University of Technology<br /> Department of Maths. &amp; Computing Science<br /> HG 9.01<br /> P.O. Box 513<br /> 5600 MB Eindhoven<br /> The Netherlands</p>

Organisers: 

John Barretto

Time: 

Tuesday, 3 January 2012, 11:30 to 12:30

Venue: 

Webpage: 

http://www.win.tue.nl/~nikhil/

Randomized rounding is a classic method to produce an integral 0/1 solution from a fractional one by interpreting the fractions as probabilities.

Generalized Network Sharing bound and Two-Unicast Networks

Speaker: 

<p>Sudeep Kamath<br /> University of California at Berkeley<br /> Department of Electrical Engineering and<br /> Computer Science<br /> California 94720<br /> United States of America</p>

Organisers: 

Vinod M. Prabhakaran

Time: 

Wednesday, 14 December 2011, 14:00 to 15:00

Venue: 

Webpage: 

http://www.eecs.berkeley.edu/~sudeep/

The talk will be in two parts.

Information Flow in Wireless Networks: From Matroids to Cell Phones

Speaker: 

Adnan Raja University of Illinois at Urbana-Champaign Coordinated Science Laboratory 1308 West Main Street Ur

Time: 

Tuesday, 18 January 2011 (All day)

Venue: 

We consider a wireless relay network where many relay nodes help communication between a source and a destination node. The goal is to understand fundamental information-theoretic limits and efficient communication architectures in such networks.

Coloring, Embedding, Compression and Data Structure Problems on Uniform Hypergraphs

Speaker: 

Saswata Shannigrahi Tata Institute of Fundamental Research School of Technology and Computer Science Homi Bhabha R

Time: 

Tuesday, 11 January 2011 (All day)

Venue: 

We study four problems on uniform hypergraph. First, we present a streaming algorithm for two-coloring uniform hypergraphs with limited number of hyperedges.

Coloring Simple Hypergraphs

Speaker: 

Dhruv Mubayi University of Illinois at Chicago Dept. of Mathematics, Statistics, and Computer Science 322 Science

Time: 

Wednesday, 11 August 2010 (All day)

Venue: 

Many problems in number theory, discrete geometry, coding theory and combinatorics can be phrased as problems about finding the independence number of certain hypergraphs.

Breathe to Stay Cool: Adjusting Cell Sizes to Reduce Energy Consumption

Speaker: 

Girija Narlikar Bell Labs, Room 2C-410 700 Mountain Avenue Murray Hill New Jersey 07974 United States

Time: 

Friday, 3 December 2010 (All day)

Venue: 

Reducing the energy consumption of a wireless cellular network is an important and urgent problem. We studied the effect of cell sizes on the energy consumed by the network, assuming base station technologies of today and the future.

Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains

Speaker: 

Girish Varma School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road <br

Time: 

Monday, 6 September 2010 (All day)

Venue: 

Most algorithmic problems could be viewed as questions being asked about a natural binary relation and we can classify them into decision, search, uniform generation and counting.

Pages

Subscribe to RSS - AG-69