## Time:

## Venue:

One of the aims of information theory is to find out the capacity of noisy channels defined as the ultimate limit on communication rates.

Speaker:

Naresh Sharma, TIFR

Wednesday, 30 November 2011, 16:00 to 17:00

One of the aims of information theory is to find out the capacity of noisy channels defined as the ultimate limit on communication rates.

Speaker:

Girish Varma, TIFR

Monday, 14 November 2011, 16:00 to 17:00

Determining the chromatic number of a graph is known to be NP-hard. We will consider the problem of coloring a $k$-colorable graph on n vertices with $n^{\alpha}$ colors (where $\alpha < 1$).

<p><a href="http://www.cs.duke.edu/~bsayan/">Sayan Bhattacharya</a><br />
Duke University<br />
Department of Computer Science<br />
N303, North Building<br />
304 Research Drive<br />
Durham, NC 27708<br />
United States of America</p>

Tuesday, 29 November 2011, 16:00 to 17:00

In recent years, algorithms for computing game-theoretic solutions have been developed for real-world security domains.

Monday, 24 October 2011, 16:00 to 17:00

Considering the large volume of sequence data that many computational biology applications must deal with, proper organization of the data to facilitate fast access is important to achieve desirable run-times.

<p>Chien-Chung Huang<br />
Humboldt-UniversitÃ¤t zu<br />
Berlin Institut fÃ¼r Informatik 10099<br />
Berlin Germany</p>

Monday, 26 September 2011 (All day)

Our input is a graph $G = (V, E)$ where each vertex ranks its neighbors in a strict order of preference. The problem is to compute a matching in $G$ that captures the preferences of the vertices in a popular way.

Devendra Desai
Rutgers University
Department of Computer Science
110 Frelinghuysen Road
Piscataway, NJ 08854-

Friday, 12 August 2011 (All day)

The 'bisection width' of a graph is defined as the minumum number of edges that need to be removed to partition the graph into two equal halves. If the graph is 'sparse', then we don't expect this quantity to be large.

Shaunak Sen
California Institute of Technology
Computing and Mathematical Sciences
Pasadena, CA
United States

Thursday, 11 August 2011 (All day)

Diverse engineering functions can be generated when simple modules are connected in different configurations. Similar modules also exist in biology, for example, within circuits of interacting molecules that map to diverse cellular behavior.

Venkat Anantharam
University of California, Berkeley
Department of Electrical Engineering
and Computer Science
<br

Tuesday, 9 August 2011 (All day)

Insurance transfers losses associated with risks to the insurer for a price, the premium. We adopt the collective risk approach. Namely, we abstract the problem to include just two agents: the insured and the insurer.

Mohit Garg
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha Road

Wednesday, 3 August 2011 (All day)

A graph is $r$-regular if all its vertices have the same degree $r$. A random $r$-regular graph with $n$ vertices is a graph sampled uniformly at random from the set of all $r$-regular graphs on $n$ vertices.

Swagato Sanyal
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha Road
<

Friday, 29 July 2011 (All day)

I want to present a portion of Shapley's paper introducing stochastic games. We'll see what the notion of value is, for such types of games.