388 search results - page 7 / 78 » The covering number in learning theory |
NN
1998
Springer
13 years 7 months ago
1998
Springer
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
ILP
2005
Springer
14 years 25 days ago
2005
Springer
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...
MFCS
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
BPM
2010
Springer
13 years 8 months ago
2010
Springer
During the previous years, we presented several results concerned with various issues related to the correctness of models for business processes and services (i. e., interorganiza...
GECCO
2005
Springer
14 years 26 days ago
2005
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...