124 search results - page 2 / 25 » On the Computability of Rectifiable Simple Curve (Extended A... |
90
Voted
ESORICS
2004
Springer
15 years 6 months ago
2004
Springer
d Abstract) James Aspnes , Joan Feigenbaum , Aleksandr Yampolskiy † , and Sheng Zhong ‡ Department of Computer Science, Yale University, New Haven CT 06520-8285, USA Abstract. ...
114
Voted
EUROCRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...
123
Voted
ICFP
1999
ACM
15 years 5 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
103
Voted
MICS
2010
14 years 11 months ago
2010
Abstract. Following Gaudry and G¨urel who extended Kedlaya’s point-counting algorithm to superelliptic curves, we introduce Harvey’s running time improvements for large enough...
109
click to vote
ISAAC
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...