We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
Todd J. Green, Gerome Miklau, Makoto Onizuka, Dan ...
Modern unsteady (multi-)field visualizations require an effective reduction of the data to be displayed. From a huge amount of information the most informative parts have to be ext...
Heike Jänicke, Alexander Wiebel, Gerik Scheuerm...
- In this paper, we present an activity recognition system using sensor sequence information generated from many binary on-off state sensors. When many sensors are deployed the num...
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...