113 search results - page 14 / 23 » Average-Case Complexity of Learning Polynomials |
81
Voted
COLT
1994
Springer
15 years 1 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
129
click to vote
AAIP
2009
14 years 10 months ago
2009
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
JMLR
2006
14 years 9 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
COMPSAC
2007
IEEE
15 years 3 months ago
2007
IEEE
Although many of the software engineering activities can now be model-supported, the model is often missing in software development. We are interested in retrieving statemachine m...
83
Voted
LATA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...