## Speaker:

## Time:

## Venue:

## Webpage:

A point cloud is an unorganized collection of a very large number of points usually with just their coordinates and no other information.

S.P. Mudur

Wednesday, 10 April 2013, 16:00 to 17:00

A point cloud is an unorganized collection of a very large number of points usually with just their coordinates and no other information.

Speaker:

Sagnik Mukhopadhyay, TIFR

Friday, 5 April 2013, 14:30 to 16:00

In the literature of communication complexity, two models of random protocols are used - common random string model and private random string model.

Himanshu Tyagi

Tuesday, 2 April 2013, 11:00 to 12:00

Information theoretic secrecy provides a framework for exploring schemes that guarantee provable unconditional security in network systems. This talk explores innate structural connections that exist between the information theoretic notion of mul

Monday, 25 March 2013 (All day) to Tuesday, 26 March 2013 (All day)

V. Sasidevan

Friday, 22 March 2013, 14:30 to 16:00

Minority Game was introduced as a model for competition between interacting agents in scarce resource conditions.

Speaker:

Girish Varma, TIFR

Friday, 15 March 2013, 14:30 to 16:00

Elections are a way of aggregating preferences made by individual voters and making a choice for the whole.

Jakob Nordström

Wednesday, 13 March 2013, 15:30 to 16:30

An active line of research in proof complexity over the last decade has been the study of proof space and trade-offs between size and space.

Speaker:

Shishir Pandey, TIFR

Friday, 8 March 2013, 14:30 to 16:00

In this talk we will give an introduction to random projections. Define the linear separability of data by a margin $\gamma$.

Speaker:

Sarat Babu Moka, TIFR

Tuesday, 5 March 2013, 11:30 to 13:00

Multiclass open queueing networks find wide applications in communication, computer and fabrication networks. Often one is interested in steady state performance measures associated with these systems.

Speaker:

Pritam Bhattacharya, TIFR

Friday, 1 March 2013, 14:30 to 16:00

Let us consider a natural generalization of the Partial Vertex Cover problem. Here, an instance consists of a graph $G = (V,E)$, a cost function $c : V -> Z^{+}$, a partition $P_{1}, . . .