The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
In this paper we propose a novel approach for modeling kernels in Radial Basis Function networks. The method provides an extra degree of flexibility to the kernel structure. This ...
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
We consider the ICP (iterative closest point) algorithm, which may in general be used for moving `active' elements such as curves and surfaces towards geometric objects whose...
A novel method for quantitatively measuring social interactions on small temporal and spatial scales on the basis of interaction geometry (reduced to the parameters interpersonal d...
Georg Groh, Alexander Lehmann, Jonas Reimers, Marc...