## Organisers:

## Time:

## Venue:

## Webpage:

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

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

Xavier Viennot

Wednesday, 27 February 2013, 16:00 to 17:00

Computer scientists defined the Strahler number of a binary tree in relation with the minimum number of registers needed for the computation of an arithmetical expression.

Xavier Viennot

Tuesday, 26 February 2013, 16:00 to 17:00

The following is reproduced from Doron Zeilberger's page:

http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/bordelaise.html.

Milind Sohoni

Tuesday, 26 February 2013, 14:30 to 15:30

Markets are of course, one of the oldest mechanism of exchanging commodities and cultural artifacts. While their history is over 5000 years old, their mathematical theory is rather recent. The first such models were by Fisher and Walras.

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$.

Speaker:

Rakesh Venkat, TIFR

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

How does one partition the vertex set of a graph into two parts $(S,S^C)$, so that the ratio of edges going across to the Volume (number of edges incident on vertices in S) in the vertex set is as small as possible?

S.P. Mudur

Friday, 15 February 2013, 11:30 to 12:30

Web Usage Mining is the application of data mining techniques for discovery and analysis of user access patterns from the interaction generated by the users in the form of access logs, proxy-server logs, browser logs, etc.

Speaker:

Naqueeb Ahmad Warsi, TIFR

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

In information theory rate distortion addresses the problem of determining the minimal number of bits per symbol, as measured by the rate $R$, that should be communicated over a channel, so that the source (input signal) can be approximately recon