2750 search results - page 23 / 550 » The complexity of learning SUBSEQ(A) |
IJON
2008
15 years 1 months ago
2008
Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Trans. Neural Networks 17(4) (2006) 879
101
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...
120
click to vote
ECCV
1996
Springer
16 years 3 months ago
1996
Springer
In Proc. European Conf. Computer Vision, 1996, pp. 357{368, Cambridge, UK The performance of Active Contours in tracking is highly dependent on the availability of an appropriate ...
112
click to vote
DAWAK
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. This paper addresses a task of variable selection which consists in choosing a subset of variables that is sufficient to predict the target label well. Here instead of tr...
117
click to vote
ILP
2004
Springer
15 years 7 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...