Sciweavers

10054 search results - page 76 / 2011
» On the Complexity of Function Learning
Sort
View
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
14 years 5 months ago
Genetically programmed learning classifier system description and results
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
Gregory Anthony Harrison, Eric W. Worden
TSP
2010
13 years 5 months ago
Complex Gaussian scale mixtures of complex wavelet coefficients
In this paper, we propose the complex Gaussian scale mixture (CGSM) to model the complex wavelet coefficients as an extension of the Gaussian scale mixture (GSM), which is for real...
Yothin Rakvongthai, An P. N. Vo, Soontorn Oraintar...
IJCNN
2006
IEEE
14 years 5 months ago
Pattern Selection for Support Vector Regression based on Sparseness and Variability
— Support Vector Machine has been well received in machine learning community with its theoretical as well as practical value. However, since its training time complexity is cubi...
Jiyoung Sun, Sungzoon Cho
SIAMCOMP
2011
13 years 6 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
ALT
2002
Springer
14 years 8 months ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
Johannes Köbler, Wolfgang Lindner