In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
We present the first evaluation of the utility of automatic evaluation metrics on surface realizations of Penn Treebank data. Using outputs of the OpenCCG and XLE realizers, along...
Dominic Espinosa, Rajakrishnan Rajkumar, Michael W...
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
The launch of new features for mobile phones is increasing and the product life cycle symmetrically decreasing in duration as higher levels of sophistication are reached. Therefor...
One of the major challenges in computer vision is to create automated systems that perform tasks with at least the same competences as human experts. In particular for automated i...
Nicole J. J. P. Koenderink, Jan L. Top, Lucas J. v...