Sciweavers

263 search results - page 23 / 53
» Splitting of Learnable Classes
Sort
View
LICS
2007
IEEE
14 years 2 months ago
A Robust Class of Context-Sensitive Languages
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
IJBC
2002
109views more  IJBC 2002»
13 years 8 months ago
Cnn Dynamics represents a Broader Class than PDES
The relationship between Cellular Nonlinear Networks (CNNs) and Partial Differential Equations (PDEs) is investigated. The equivalence between discrete-space CNN models and contin...
Marco Gilli, Tamás Roska, Leon O. Chua, Pie...
ALT
2006
Springer
14 years 5 months ago
Towards a Better Understanding of Incremental Learning
Abstract. The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requi...
Sanjay Jain, Steffen Lange, Sandra Zilles
APPROX
2005
Springer
80views Algorithms» more  APPROX 2005»
14 years 2 months ago
On Learning Random DNF Formulas Under the Uniform Distribution
Abstract: We study the average-case learnability of DNF formulas in the model of learning from uniformly distributed random examples. We define a natural model of random monotone ...
Jeffrey C. Jackson, Rocco A. Servedio
COLT
2000
Springer
14 years 1 months ago
Average-Case Complexity of Learning Polynomials
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
Frank Stephan, Thomas Zeugmann