Sciweavers

10054 search results - page 82 / 2011
» On the Complexity of Function Learning
Sort
View
ICML
2005
IEEE
16 years 1 months ago
An efficient method for simplifying support vector machines
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...
DucDung Nguyen, Tu Bao Ho
ICTAI
2006
IEEE
15 years 6 months ago
Intelligent Optimization via Learnable Evolution Model
A new method for optimizing complex functions and systems is described that employs Learnable Evolution Model (LEM), a form of non-Darwinian evolutionary computation guided by mac...
Ryszard S. Michalski, Janusz Wojtusiak, Kenneth A....
COLT
1992
Springer
15 years 4 months ago
On the Computational Power of Neural Nets
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
Hava T. Siegelmann, Eduardo D. Sontag
ICASSP
2010
IEEE
15 years 19 days ago
Hierarchical Gaussian Mixture Model
Gaussian mixture models (GMMs) are a convenient and essential tool for the estimation of probability density functions. Although GMMs are used in many research domains from image ...
Vincent Garcia, Frank Nielsen, Richard Nock
101
Voted
AAAI
1993
15 years 1 months ago
Complexity Analysis of Real-Time Reinforcement Learning
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
Sven Koenig, Reid G. Simmons