We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log2 n log log n) time complexity of the Sch
We describe an FPGA accelerator for the Kannan–Fincke– Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementati...
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...
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...