We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
The problem is sequence prediction in the following setting. A sequence x1, . . . , xn, . . . of discrete-valued observations is generated according to some unknown probabilistic ...
—This paper compares and illustrates the use of manually and automatically assigned descriptors on German documents extracted from the GIRT Corpus. A second objective is to analy...
In this paper, we motivate four di erent user de ned window query classes and derive a probabilistic model for each of them. For each model, we characterize the e ciency of spatia...
Bernd-Uwe Pagel, Hans-Werner Six, Heinrich Toben, ...