9659 search results - page 64 / 1932 » Points on Computable Curves |
WALCOM
2010
IEEE
15 years 6 months ago
2010
IEEE
Let A and B be two families of two-way infinite x-monotone curves, no three of which pass through the same point. Assume that every curve in A lies above every curve in B and that...
EUROCRYPT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so tha...
109
click to vote
CORR
2007
Springer
14 years 12 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
101
click to vote
IWCIA
2004
Springer
15 years 5 months ago
2004
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
GRAPHITE
2004
ACM
15 years 5 months ago
2004
ACM
This article introduces a new class of constraints for spline variational modeling, which allows more flexible user specification, as a constrained point can ”slide” along a...