## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

We propose a model for interaction between an user-set (market) and a service-provider (firm) when the offered demand is sensitive to the offered Quality of Service.

N. Hemachandra

Tuesday, 16 April 2013, 15:00 to 16:00

We propose a model for interaction between an user-set (market) and a service-provider (firm) when the offered demand is sensitive to the offered Quality of Service.

Speaker:

Manoj Gopalkrishnan, TIFR

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

+ Tom Kurtz, in a classic paper from 1972, showed that stochastic models for chemical reactions and deterministic models are related: in the limit of volume going to infinity, the stochastic model approaches the deterministic model.

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.

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.

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

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.

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}, . . .

Speaker:

Sagnik Mukhopadhyay, TIFR

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

Abstract: Let A be an $n \times n$ boolean matrix, i.e., its entries come from the set $\{0,1\}$. Let $r_i$ denote the number of 1's in the row $i$.