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...
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Recently, a lot of indexing methods were developed for multidimensional spaces and for image feature vector spaces in particular. This paper introduces an implementation of a vant...
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...