496 search results - page 17 / 100 » Machine models and lower bounds for query processing |
JMLR
2002
13 years 7 months ago
2002
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
ICIC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the approximation of the integration of multivariate functions classes in the quantum model of computation. We first obtain a lower bound of the n-th minimal qu...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
DEBS
2009
ACM
14 years 2 months ago
2009
ACM
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...