## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Abstract: Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a very important problem.

Deeparnab Chakrabarty

Tuesday, 3 May 2016, 16:00 to 17:00

Abstract: Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a very important problem.

Srikanth Srinivasan

Tuesday, 26 April 2016, 16:00 to 17:00

Abstract: A threshold gate is a Boolean function that accepts its input based on whether some weighted linear combination of its inputs exceeds some fixed threshold value or not. A threshold circuit is a circuit made up of threshold gates.

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 ?

Amey Karkare

Tuesday, 9 February 2016, 16:00 to 17:00

Abstrat: Current garbage collectors leave much heap-allocated data uncollected because they preserve data reachable from a root set.

Manjunath Krishnapur

Tuesday, 23 February 2016, 16:00 to 17:00

Abstract: S. Ghosh and Y. Peres showed that in certain point processes, the configuration outside a bounded domain determines the number of points of the process inside the domain (and in some cases even the center of mass).

Andrej Bogdanov

Wednesday, 2 March 2016, 16:00 to 17:00

Abstract: A $t$-out-of-$n$ threshold secret sharing scheme is a protocol for sharing a secret among $n$ parties so that no $t -1$ parties gain any information about the secret but any $t$ parties can recover the secret.

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

Rajesh Sundaresan

Tuesday, 19 January 2016, 15:30 to 16:30

Abstract: Kelly, Maulloo, and Tan (1998) proposed a decomposition of a system utility maximisation problem into a network utility maximisation problem, to be solved by a network entity, and a set of decoupled user optimisation problems, to be solv

Rohit Parikh

Tuesday, 12 January 2016, 16:00 to 17:00

Abstract: We discuss two issues regarding group knowledge.

Deepak Kapur

Tuesday, 22 December 2015, 16:00 to 17:00

Abstract: An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed.