1036 search results - page 69 / 208 » Algorithms for Learning Regular Expressions |
119
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
We1 present a new actor-critic learning model in which a Bayesian class of non-parametric critics, using Gaussian process temporal difference learning is used. Such critics model ...
WIA
2004
Springer
15 years 7 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
CONCUR
2010
Springer
15 years 2 months ago
2010
Springer
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
121
Voted
COLT
2003
Springer
15 years 7 months ago
2003
Springer
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
108
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...