Sciweavers

5699 search results - page 10 / 1140
» Alternating model trees
Sort
View
COLING
2002
14 years 10 months ago
A Stochastic Parser Based on an SLM with Arboreal Context Trees
In this paper, we present a parser based on a stochastic structured language model (SLM) with a exible history reference mechanism. An SLM is an alternative to an n-gram model as...
Shinsuke Mori
ICDT
2010
ACM
259views Database» more  ICDT 2010»
15 years 8 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira

Publication
404views
15 years 7 months ago
Bayesian variable order Markov models.
We present a simple, effective generalisation of variable order Markov models to full online Bayesian estimation. The mechanism used is close to that employed in context tree wei...
Christos Dimitrakakis
ICALP
2009
Springer
15 years 11 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong
EUROGP
2004
Springer
145views Optimization» more  EUROGP 2004»
15 years 4 months ago
Toward an Alternative Comparison between Different Genetic Programming Systems
In this paper, we use multi-objective techniques to compare different genetic programming systems, permitting our comparison to concentrate on the effect of representation and sepa...
Nguyen Xuan Hoai, Robert I. McKay, Daryl Essam, Hu...