We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
Distributed search systems are an emerging phenomenon in Web search, in which independent topic-specific search engines provide search services, and metasearchers distribute user...
— When a database system is extended with the skyline operator, it is important to determine the most efficient way to execute a skyline query across tables with join operations...
Wen Jin, Michael D. Morse, Jignesh M. Patel, Marti...