## 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:

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

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?

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

Chien-Chung Huang

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

In an atomic splittable routing game, each player controls a non-negligible, splittable flow in a network. Each edge has a delay that is a function of the total flow on the edge.

Speaker:

Gugan Thoppe, TIFR

Friday, 11 January 2013, 15:00 to 16:30

The method of variation of parameters, credited to J.L. Lagrange, expresses each solution of the perturbed system of differential equations, $x' = A(t)x + f(t)$, in terms of the solution of the associated homogeneous system, $y' = A(t)y$.

Speaker:

Tapan Shah, TIFR

Friday, 21 December 2012, 15:00 to 16:30

Boosting is a general method to improve the accuracy of any givenlearning algorithm.

Speaker:

Karthyek Rajhaa A M, TIFR

Friday, 7 December 2012, 15:00 to 16:30

In this talk, we shall discuss various notions of convergence of dense graphs, and attempt to come up with a metric space where the notion of "left convergence" of graphs can be identified with Cauchy convergence.

Speaker:

Rakesh Venkat, TIFR

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

Imagine a secret agent in a terrorist camp who needs to get messages to the outside world.