Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
feuse of its devstting eets in utions nd other mehnismsD ollusion is prohiited nd leglly proseutedF etD olluders hve lwys existedD nd my ontinue to existF e thus rise the followin...
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
Adam Tauman Kalai, Ankur Moitra, and Gregory Valia...
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...