2750 search results - page 13 / 550 » The complexity of learning SUBSEQ(A) |
JMLR
2006
13 years 7 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
COLT
2000
Springer
13 years 11 months ago
2000
Springer
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...
NECO
2010
13 years 5 months ago
2010
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
ICANN
2009
Springer
14 years 4 hour ago
2009
Springer
The sequential structure of complex actions is apparently at an abstract “cognitive” level in several regions of the frontal cortex, independent of the control of the immediate...
EUROCOLT
1995
Springer
13 years 11 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...