We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
The Iterative Closest Point (ICP) algorithm is a widely used method for aligning three-dimensional point sets. The quality of alignment obtained by this algorithm depends heavily ...
This work examines the dendritic cell algorithm (DCA) from a mathematical perspective. By representing the signal processing phase of the algorithm using the dot product it is sho...
Thomas Stibor, Robert Oates, Graham Kendall, Jonat...
The computer--aidedsolution to algorithmic problemsis becoming moreandmoreimportant in variousapplicationdomains.This is in particular true for computationalgeometry.For example,g...
As the size and complexity of VLSI circuits increase, the need for faster floorplanning algorithms also grows. In this work we introduce Traffic, a new method for creating wire- a...