10054 search results - page 14 / 2011 » On the Complexity of Function Learning |
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
IJCNN
2000
IEEE
15 years 4 months ago
2000
IEEE
A self-organizing neural network for learning and recall of complex temporal sequences is proposed. we consider a single sequence with repeated items, or several sequences with a c...
102
click to vote
IJCNN
2000
IEEE
15 years 3 months ago
2000
IEEE
For unsupervised clustering in a network of spiking neurons we develop a temporal encoding of continuously valued data to obtain arbitrary clustering capacity and precision with a...
ESANN
2006
15 years 1 months ago
2006
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...
ICML
2009
IEEE
16 years 16 days ago
2009
IEEE
We propose an importance weighting framework for actively labeling samples. This technique yields practical yet sound active learning algorithms for general loss functions. Experi...