We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
The complex interactions of natural swarms, for example formed by some social insects, are difficult to comprehend. Considering tasks such as nestbuilding, the necessary underlyin...
Sebastian von Mammen, Christian Jacob, Gabriella K...
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
—To recover texture images from impulse noise by the opening operation which is one of morphological operations, an suitable structuring element (SE) has to be estimated. Hithert...