Sciweavers

16188 search results - page 38 / 3238
» The Optimal PAC Algorithm
Sort
View
MFCS
2007
Springer
14 years 2 months ago
Evolvability
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
Leslie G. Valiant
STACS
1999
Springer
14 years 1 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
LREC
2010
196views Education» more  LREC 2010»
13 years 10 months ago
An Evaluation of Predicate Argument Clustering using Pseudo-Disambiguation
Schulte im Walde et al. (2008) presented a novel approach to semantic verb classication. The predicate argument model (PAC) presented in their paper models selectional preferences...
Christian Scheible
IVC
2010
128views more  IVC 2010»
13 years 7 months ago
Online kernel density estimation for interactive learning
In this paper we propose a Gaussian-kernel-based online kernel density estimation which can be used for applications of online probability density estimation and online learning. ...
Matej Kristan, Danijel Skocaj, Ales Leonardis
EUROPAR
2011
Springer
12 years 8 months ago
A Fully Empirical Autotuned Dense QR Factorization for Multicore Architectures
: Tuning numerical libraries has become more difficult over time, as systems get more sophisticated. In particular, modern multicore machines make the behaviour of algorithms hard ...
Emmanuel Agullo, Jack Dongarra, Rajib Nath, Stanim...