3250 search results - page 2 / 650 » Parameterized Learning Complexity |
ECAI
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
LATA
2010
Springer
13 years 11 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...
ECCC
2007
13 years 5 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
Principal ComponentAnalysis (PCA) has been successfully applied to construct linear models of shape, graylevel, and motion. In particular, PCA has been widely used to model the var...
COLT
1993
Springer
13 years 10 months 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...