10054 search results - page 420 / 2011 » On the Complexity of Function Learning |
122
click to vote
ICML
2007
IEEE
16 years 5 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...
152
click to vote
NPL
2002
15 years 4 months ago
2002
The learning of complex relationships can be decomposed into several neural networks. The modular organization is determined by prior knowledge of the problem that permits to split...
125
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
140
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: siRNAs are small RNAs that serve as sequence determinants during the gene silencing process called RNA interference (RNAi). It is well know that siRNA efficiency is cr...
236
click to vote
SIAMIS
2010
14 years 11 months ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...