263 search results - page 18 / 53 » Splitting of Learnable Classes |
COLT
2001
Springer
14 years 1 months ago
2001
Springer
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a finite number of its output values. Unifor...
ALT
2005
Springer
14 years 5 months ago
2005
Springer
In language learning, strong relationships between Gold-style models and query models have recently been observed: in some quite general setting Gold-style learners can be replaced...
COLT
1993
Springer
14 years 22 days ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
ICGI
2000
Springer
14 years 7 days ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
FLAIRS
2004
13 years 10 months ago
2004
Within the geographic domain, an important class of relies on geometric abstractions in the form of lines where, for instance, transportation networks and trajectories of movement...