72 search results - page 8 / 15 » Learning Stochastic Finite Automata |
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
ALT
2010
Springer
13 years 4 months ago
2010
Springer
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we investigate the channel selection strategy for secondary users in cognitive radio networks. We claim that in order to avoid the costly channel switchings, a s...
ALT
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
AAAI
2004
13 years 9 months ago
2004
In this paper we report some of the research endeavors we are embarking on as part of the Doctoral research of the first author. We have already completed an investigation of some...