3250 search results - page 279 / 650 » Parameterized Learning Complexity |
154
click to vote
PODS
2010
ACM
15 years 10 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
136
click to vote
ECAI
2000
Springer
15 years 9 months ago
2000
Springer
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
168
click to vote
ALT
1997
Springer
15 years 9 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
163
click to vote
COLT
1993
Springer
15 years 9 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
142
click to vote
AUTONOMICS
2007
ACM
15 years 9 months ago
2007
ACM
Abstract. Adaptation of devices and applications based on contextual information has a great potential to enhance usability and mitigate the increasing complexity of mobile devices...