Sciweavers

1730 search results - page 153 / 346
» Shimura Curve Computations
Sort
View
MOC
2002
121views more  MOC 2002»
15 years 4 months ago
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...
Andreas Enge
CAD
2005
Springer
15 years 5 months ago
Non-self-overlapping Hermite interpolation mapping: a practical solution for structured quadrilateral meshing
This paper addresses the problem of constructing a structured quadrilateral grid inside a given four-sided 2D region by a particular boundary-conforming mapping scheme
Charlie C. L. Wang, Kai Tang
ICIP
2005
IEEE
16 years 6 months ago
Three-dimensional feature detection using optimal steerable filters
We present a framework for feature detection in 3-D using steerable filters. These filters can be designed to optimally respond to a particular type of feature by maximizing sever...
François Aguet, Mathews Jacob, Michael Unse...
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
16 years 2 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
129
Voted
ISSAC
2009
Springer
163views Mathematics» more  ISSAC 2009»
15 years 11 months ago
Fast arithmetics in artin-schreier towers over finite fields
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
Luca De Feo, Éric Schost