10 search results - page 1 / 2 » A Fast Euclidean Algorithm for Gaussian Integers |
JSC
2002
13 years 5 months ago
2002
ANTS
1994
Springer
13 years 9 months ago
1994
Springer
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l1; l2; and l1;norm. The algorithm runs in at most O(n M(B) logB) bit op...
ANTS
2004
Springer
13 years 10 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...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Common visual codebook generation methods used in
a Bag of Visual words model, e.g. k-means or Gaussian
Mixture Model, use the Euclidean distance to cluster features
into visual...