263 search results - page 15 / 53 » Splitting of Learnable Classes |
143
Voted
ICGI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Kanazawa has shown that several non-trivial classes of categorial grammars are learnable in Gold’s model. We propose in this article to adapt this kind of symbolic lear...
147
Voted
FOCS
1990
IEEE
15 years 7 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
124
Voted
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
In practical classification, there is often a mix of learnable and unlearnable classes and only a classifier above a minimum performance threshold can be deployed. This problem is...
118
Voted
WG
2004
Springer
15 years 9 months ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
142
Voted
FOCM
2011
14 years 7 months ago
2011
We consider a wide class of semi linear Hamiltonian partial differential equations and their approximation by time splitting methods. We assume that the nonlinearity is polynomia...