## Organisers:

## Time:

## Venue:

## Webpage:

Suppose we have a number of items, each item belongs to either class 1 or class 2.

Speaker:

Shishir Pandey, TIFR

Friday, 30 March 2012, 15:00 to 16:30

Suppose we have a number of items, each item belongs to either class 1 or class 2.

Saurabh Ray

Tuesday, 27 March 2012, 16:00 to 17:00

Epsilon nets and approximations are among the most fundamental notions of sampling.

Saurabh Ray

Monday, 26 March 2012, 11:30 to 12:30

Given a set $P$ of $n$ points in $R^d$, a weak $epsilon$-net of $P$ with respect to convex sets in a subset of $R^d$ that intersects every convex set containing an $epsilon$-fraction of the points in $P$.

Sanjeev Arora

Tuesday, 20 March 2012, 14:30 to 15:30

Machine learning is a flourishing field with a plethora of algorithmic techniques.

Speaker:

Naqueeb Ahmad Warsi, TIFR

Friday, 16 March 2012, 15:00 to 16:30

This talk is based on "Simple channel coding bounds" by Wang et al, ISIT, 2009. New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel.

Speaker:

Rakesh Venkat, TIFR

Friday, 9 March 2012, 15:00 to 16:30

Problems in Metric embedding involve mapping a set (for our purposes, finite) of points from one metric space to another, while preserving pairwise distances.

Monday, 5 March 2012, 11:30 to 12:30

In this talk, we discuss the problem of data transmission in a single input, multiple output wireless communication system with channel estimation at both transmitter and receiver, from a Diversity- Multiplexing gain Trade-off (DMT) perspective.

Speaker:

Tapan Shah, TIFR

Friday, 2 March 2012, 15:00 to 16:30

I will introduce a very simple social interaction model of information transmission, opinion formation and consensus formation by De Groot. We will study sufficient and necessary conditions to converge to a consensus in very simple networks.

Speaker:

Swagato Sanyal, TIFR

Wednesday, 29 February 2012, 14:00 to 15:30

Markov chain is a stochastic process which has been found effective in modelling a wide variety of situations and phenomena in computer science.

Speaker:

Naqueeb Ahmad Warsi, TIFR

Tuesday, 28 February 2012, 14:30 to 15:30

Slepian and Wolf gave the rate-region for the distributed encoding of correlated and memoryless sources when the number of copies of source output is unlimited.