STCS Colloquium

Logical Dynamics in Large Games

Speaker: 

R. Ramanujam

Organisers: 

Prahladh Harsha

Time: 

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

Venue: 

Webpage: 

http://www.imsc.res.in/~jam/

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 ?

Rigidity and Tolerance of Point Processes

Speaker: 

Manjunath Krishnapur

Organisers: 

Prahladh Harsha

Time: 

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

Venue: 

Webpage: 

http://math.iisc.ernet.in/~manju/

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

Threshold Secret Sharing Requires a Linear Size Alphabet

Speaker: 

Andrej Bogdanov

Organisers: 

Prahladh Harsha

Time: 

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

Venue: 

Webpage: 

http://www.cse.cuhk.edu.hk/~andrejb/

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.

$D^2$ Sampling and the $k$-means Problem

Speaker: 

Amit Kumar

Organisers: 

Prahladh Harsha

Time: 

Tuesday, 29 March 2016, 16:00 to 17:00

Venue: 

Webpage: 

http://www.cse.iitd.ernet.in/~amitk/

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

System Utility Maximisation With Fast Network and User Adaptation

Speaker: 

Rajesh Sundaresan

Organisers: 

Vinod M. Prabhakaran

Time: 

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

Venue: 

Webpage: 

http://www.ece.iisc.ernet.in/~rajeshs/

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

Interpolation Synthesis for Quadratic Polynomial Inequalities and Combination with Theory of Equality with Uninterpreted Function Symbols (EUF)

Speaker: 

Deepak Kapur

Organisers: 

N Raja

Time: 

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

Venue: 

Webpage: 

https://www.cs.unm.edu/~kapur/

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

Primal-Dual Algorithms in Scheduling

Speaker: 

Naveen Garg

Organisers: 

Umang Bhaskar

Time: 

Tuesday, 17 November 2015, 16:00 to 17:00

Venue: 

Webpage: 

http://www.iitd.ac.in/content/prof-naveen-garg-cse

Abstract: Recent years have seen application of Linear programming techniques to solve problems in scheduling. One technique that has been applied very effectively to both online and offline scheduling problems is the Primal-Dual method.

Pages

Subscribe to RSS - STCS Colloquium