Description: Professor Mihalis Yannakakis has been one of the leading lights in theoretical computer science for many years, and he has made deep and lasting contributions to an extraordinary range of topics in theory, including in algorithms and complexity theory, combinatorial optimization, automated verification and testing theory, and database theory. This workshop will bring [...]
Horizons in TCS: A Celebration of Mihalis Yannakakis’s 60th Birthday — August 27-29, 2013
January 21, 2013 By
Workshop: Provable Bounds in Machine Learning — August 1-2, 2012
July 19, 2012 By
Description: Many current approaches in machine learning are heuristic: we cannot prove good bounds on either their performance or their running time. This small workshop will focus on the project of designing algorithms and approaches whose performance can be analyzed rigorously. The goal is to look beyond settings where provable bounds already exist. Participation by [...]