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?
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 ?
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.
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.
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
Abstract: All aspects of our lives are becoming ever more complex. This is primarily due to our ever increasing expectations to live a life that is more comfortable, efficient, inclusive, etc.
Abstract: A classical problem in mobile telephony is to decide user-basestation association, i.e., given large number of mobile users, which basestation should each mobile user connect to.
