Sciweavers

9659 search results - page 82 / 1932
» Points on Computable Curves
Sort
View
IEEECGIV
2009
IEEE
15 years 6 months ago
Monomial Forms for Curves in CAGD with their Applications
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
Chanon Aphirukmatakun, Natasha Dejdumrong
CORR
2006
Springer
114views Education» more  CORR 2006»
14 years 12 months ago
Fast algorithms for computing isogenies between elliptic curves
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
Alin Bostan, Bruno Salvy, François Morain, ...
EUROCRYPT
2011
Springer
14 years 3 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
CCA
2009
Springer
15 years 3 months ago
On the Computability of Rectifiable Simple Curve (Extended Abstract)
d Abstract) Robert Rettinger1 and Xizhong Zheng2,3 1 Lehrgebiet Algorithmen und Komplexit
Robert Rettinger, Xizhong Zheng
ICPR
2000
IEEE
16 years 29 days ago
Exact Computation of Area Moments for Spline and Wavelet Curves
We present an exact algorithm for the computation of the moments of a region bounded by a curve represented in a scaling function or wavelet basis. Using Green's theorem, we ...
Mathews Jacob, Thierry Blu, Michael Unser