## Organisers:

## Time:

## Venue:

## Webpage:

Decision trees are used in machine learning a lot. In this talk I will give a brief introduction to decision trees.

Speaker:

Shishir Pandey, TIFR

Friday, 21 June 2013, 14:30 to 16:00

Decision trees are used in machine learning a lot. In this talk I will give a brief introduction to decision trees.

Kamal Lodaya

Wednesday, 12 June 2013, 11:00 to 12:00

A little over 50 years ago (1962), we had the first nontrivial theorem which used an algebraic approach to automata theory: Schuetzenberger's theorem giving an algorithm to check whether a given regular language is definable using a starfree expre

Speaker:

Sagnik Mukhopadhyay, TIFR

Friday, 7 June 2013, 14:30 to 16:00

As with other areas of computer science, lower bounds play an essential role in the field of property testing. The question can be posed as follows.

Ankur Kulkarni

Thursday, 6 June 2013, 11:00 to 12:00

A deletion channel is communication medium that takes a string of symbols as input, deletes a fixed number of them and outputs the remaining symbols by aligning them without changing their order.

Sathya Peri

Wednesday, 22 May 2013, 16:00 to 17:00

There has been considerable interest in Software Transactional Memory in recent years. The reason for rise in STM is due to rise of multicore computers.

Vivek Sarkar

Wednesday, 22 May 2013, 11:00 to 12:00

The two dominant paradigms for scientific discovery have historically been theory and experiments, with large-scale simulations emerging as the third paradigm in the 20th century.

Sriram Rajamani

Tuesday, 21 May 2013, 11:30 to 12:30

Probabilistic models, particularly those with causal dependencies, can be succinctly written as probabilistic programs.

D. Yogeshwaran

Tuesday, 14 May 2013, 11:00 to 12:00

The field of topological data analysis has received attention in the recent years and a key object of study are random simplicial complexes.

Dominik Wojtczak

Friday, 10 May 2013, 14:30 to 15:30

I will survey the state of the art in the automated analysis of several classes of probabilistic infinite-state systems which naturally arise when studying probabilistic programs with recursive calls, queueing systems, population dynamics

Deeparnab Chakrabarty

Thursday, 2 May 2013, 15:30 to 16:30

A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is monotone if $f(x) \geq f(y)$ whenever $x > y$, that is, all coordinates of $x$ dominate those of $y$.