161 search results - page 7 / 33 » Learning Finite Automata Using Label Queries |
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
COLT
1994
Springer
13 years 11 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
SIS
2007
13 years 8 months ago
2007
Access control models for XML data can be classified in two major categories: node filtering and query rewriting systems. The first category includes approaches that use access ...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...