We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
Annotations on digital documents have clear advantages over annotations on paper. They can be archived, shared, searched, and easily manipulated. Freeform digital ink annotations a...
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, ...
This paper is about people. It is about understanding how learning and communication mutually influence one another; allowing people to infer each other's communicative behavi...
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...