10 search results - page 2 / 2 » A Fast Euclidean Algorithm for Gaussian Integers |
ANTS
2004
Springer
13 years 11 months ago
2004
Springer
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
EUROCRYPT
2005
Springer
13 years 11 months ago
2005
Springer
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
CALC
2001
Springer
13 years 10 months ago
2001
Springer
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
TIP
2008
13 years 5 months ago
2008
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
2D Active Appearance Models (AAM) and 3D Morphable
Models (3DMM) are widely used techniques. AAM
provide a fast fitting process, but may represent unwanted
3D transformations un...