1728 search results - page 24 / 346 » The Accelerated Euclidean Algorithm |
COCOA
2008
Springer
15 years 29 days ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
ANTS
2004
Springer
15 years 4 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
ICPR
2010
IEEE
14 years 9 months ago
2010
IEEE
This paper analyses the computational complexity and stability of an online algorithm recently proposed for learning rotations. The proposed algorithm involves multiplicative upda...
SIAMCOMP
2002
14 years 10 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
DGCI
2009
Springer
15 years 5 months ago
2009
Springer
In this report, we propose a new definition of the E2 DT (Squared Euclidean Distance Transformation) on irregular isothetic grids. We describe a new separable algorithm to compute...