## Speaker:

## Time:

## Venue:

We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether a graph is planar, is a forest, or does not contain a path of a given length.

Robin Kothari
University of Waterloo
Institute for Quantum Computing
200 University Ave. West
Waterloo, Ontar

Wednesday, 27 April 2011 (All day)

We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether a graph is planar, is a forest, or does not contain a path of a given length.

Amit Deshpande
Microsoft Research Lab.,
â€œScientiaâ€
196/36 2nd Main
Sadashivnagar
Bangalore 560 080<b

Thursday, 21 April 2011 (All day)

`Dyad' means a pair, `dyadic' means binary, and in this talk I'll present some simple algorithms for rounding real vectors to 0-1 vectors without losing much.

Sameer Kamal
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha Road
<br

Thursday, 21 April 2011 (All day)

Srihari Vasudevan
The University of Sydney
Australian Centre for Field Robotics
Rose Street Building J04
NSW

Tuesday, 19 April 2011 (All day)

This talk will focus on the problem of large scale multi-sensor multi-data-set sensor based perception and sensor fusion. The application context of this study is large scale terrain modeling for mining automation.

Neeraj Kayal
Microsoft Research Lab.,
â€œScientiaâ€
196/36 2nd Main
Sadashivnagar
Bangalore 560 080<br/

Tuesday, 19 April 2011 (All day)

Let a_1, a_2, ..., a_n and b_1, b_2, ..., b_n be positive integers each of which is at most n bits long. Let S be the difference between the sum of square roots of a_i's and the sum of square roots of the b_j's.

Kalyanasundaram Subramanian
Strand Life Sciences
5th Floor, Kirloskar Business Park
Bellary Road
Hebbal

Wednesday, 13 April 2011 (All day)

Various in silico methods are employed to predict toxicity in pharmaceutical R&D. The methods can range from simple structural alerts all the way to detailed mechanistic modeling of biological systems.

Rakesh Venkat
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha Road
<b

Tuesday, 12 April 2011 (All day)

Last time around we saw some interesting and non-intuitive behaviour of volumes and surfaces in high dimensions.

Manoj Gopalkrishnan
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha R

Thursday, 7 April 2011 (All day)

Sayan Bhattacharya
Duke University
Department of Computer Science
N303, North Building
304 Research Drive
<br

Tuesday, 5 April 2011 (All day)

Suppose we want to design an auction for selling items to a set of customers. Such an auction will take the valuations of the customers as input, and specify the allocation of the items and the payments.

Rakesh Venkat
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha Road
<b

Tuesday, 5 April 2011 (All day)

We know that the Gaussian distribution concentrates sharply around its mean, ie. the probability mass outside a few standard deviations decreases exponentially in the number of steps taken.