Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
The purpose of this paper is to study the problem of pattern classification as this is presented in the context of data mining. Among the various approaches we focus on the use of ...
Nikos Pelekis, Babis Theodoulidis, Ioannis Kopanak...
We consider multiple agents who's task is to determine the true state of a uncertain domain so they can act properly. If each agent only has partial knowledge about the domai...
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...