## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Data security challenges faced in the modern world demand functionality from encryption systems that traditional public key cryptography falls far short in delivering.

Shweta Agrawal

Friday, 20 April 2012, 10:30 to 11:30

Data security challenges faced in the modern world demand functionality from encryption systems that traditional public key cryptography falls far short in delivering.

Speaker:

Simoni S. Shah, TIFR

Tuesday, 17 April 2012, 16:00 to 17:30

Regular languages exhibit considerable structure.

Shashi Mittal

Monday, 16 April 2012, 16:00 to 17:00

We present a fully polynomial time approximation scheme (FPTAS) for optimizing a very general class of non-linear functions of low rank over a polytope.

Rohit Chadha

Friday, 13 April 2012, 10:00 to 11:00

The widespread use of internet has raised serious concerns of privacy and trust. In order to address these concerns, cryptographic protocols are widely used.

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.