Sciweavers

139 search results - page 5 / 28
» Computing crossing numbers in quadratic time
Sort
View
ANTS
2004
Springer
139views Algorithms» more  ANTS 2004»
14 years 2 months ago
Binary GCD Like Algorithms for Some Complex Quadratic Rings
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,...
Saurabh Agarwal, Gudmund Skovbjerg Frandsen
IMR
2003
Springer
14 years 1 months ago
Combined Laplacian and Optimization-based Smoothing for Quadratic Mixed Surface Meshes
Quadratic elements place stringent requirements on a surface mesh smoother. One of the biggest challenges is that a good linear element may become invalid when mid-side nodes are ...
Zhijian Chen, Joseph R. Tristano, Wa Kwok
ECCV
2010
Springer
14 years 1 months ago
The Quadratic-Chi Histogram Distance Family
We present a new histogram distance family, the Quadratic-Chi (QC). QC members are Quadratic-Form distances with a cross-bin χ2 -like normalization. The cross-bin χ2 -like normal...
FCT
2003
Springer
14 years 1 months ago
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equival...
Ivan Damgård, Gudmund Skovbjerg Frandsen
ICPR
2008
IEEE
14 years 9 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson