## Time:

## Venue:

Machine translation has been one of the key problems in computational linguistics. An important part of the same is to get the order of words in the translated sentence correct.

Speaker:

Anamay Tengse, TIFR

Friday, 22 April 2016,

15:30 to 17:00

Machine translation has been one of the key problems in computational linguistics. An important part of the same is to get the order of words in the translated sentence correct.

Bruno Loff

Wednesday, 20 April 2016,

16:00 to 17:00

Abstract: Suppose that you have log(n) bits of free working memory, plus an additional poly(n) bits of auxiliary memory which is *full*.

Gugan Thoppe

Tuesday, 19 April 2016,

14:00 to 15:00

Abhishek Behera

Friday, 15 April 2016,

16:00 to 17:00

One may wonder how do micro-organisms process spatially and temporally extensive information about their environment and respond in a manner that maximizes their fitness?

R. Ramanujam

Tuesday, 12 April 2016,

16:00 to 17:00

Abstract: How would you strategize in a game with say, 50 players? If the game were repeated many times, and you saw that your neighbour was doing well in several previous rounds, would you be tempted to imitate the neighbour in the next round ?

Michal Koucky

Wednesday, 6 April 2016,

16:00 to 17:00

Abstract: The Hamming and the edit metrics are two common notions of measuring distances between pairs of strings $x,y$ lying in the Boolean hypercube.

Sumedh Tirodkar

Friday, 1 April 2016,

16:00 to 17:00

Abstract: In this series of two talks, we will investigate the power of randomized algorithms for the maximum cardinality matching (MCM) and the maximum weight matching (MWM) problems in the online preemptive model.

Speaker:

Tulasi mohan Molli, TIFR

Thursday, 31 March 2016,

14:00 to 15:00

Abstract: In this talk, we will see some lower bound techniques for depth 2 circuits with threshold and mod gates.

Sumedh Tirodkar

Wednesday, 30 March 2016,

10:00 to 11:00

**The second talk in this series will be given on Friday, April 01, 2016 at 1600 hours in A-201.**

Amit Kumar

Tuesday, 29 March 2016,

16:00 to 17:00

Abstract: Given a set of points $P$ in a $d$-dimensional Euclidean space, the $k$-means clustering problem seeks to find a set $C$ of $k$ centers such that the sum over all points in $P$ of the square of the distance to the closest center in $C$ i

Rahul Vaze's paper

- ‹ previous
- 3 of 11
- next ›