Sciweavers

1728 search results - page 1 / 346
» The Accelerated Euclidean Algorithm
Sort
View
CORR
2004
Springer
138views Education» more  CORR 2004»
13 years 10 months ago
The Accelerated Euclidean Algorithm
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
Sidi Mohamed Sedjelmaci
LATINCRYPT
2010
13 years 9 months ago
Accelerating Lattice Reduction with FPGAs
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...
Jérémie Detrey, Guillaume Hanrot, Xa...
CAGD
2004
87views more  CAGD 2004»
13 years 10 months ago
Gliding spline motions and applications
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...
Johannes Wallner
BROADNETS
2007
IEEE
14 years 5 months ago
Optimizing dimensionality and accelerating landmark positioning for coordinates based RTT predictions
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...
Dragan Milic, Torsten Braun
IPL
2007
104views more  IPL 2007»
13 years 10 months ago
A linear-time algorithm for Euclidean feature transform sets
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...
Wim H. Hesselink