9659 search results - page 83 / 1932 » Points on Computable Curves |
84
Voted
PRL
2006
14 years 11 months ago
2006
This paper studies the k-segments algorithm proposed by Verbeek et al. [Verbeek, J.J., Vlassis, N., Krose, B., 2002. A k-segments algorithm for finding principal curves, Pattern R...
100
click to vote
PKC
2010
Springer
15 years 3 months ago
2010
Springer
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
We present an algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. Our noise model assumes that the samples are obtained by first drawing po...
MICS
2010
14 years 10 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...
107
click to vote
DCC
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...