9659 search results - page 198 / 1932 » Points on Computable Curves |
169
click to vote
ASIACRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
213
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
136
click to vote
JSC
2008
15 years 6 months ago
2008
We outline PARI programs which assist with various algorithms related to descent via isogeny on elliptic curves. We describe, in this context, variations of standard inequalities w...
186
click to vote
GMP
2006
IEEE
16 years 21 days ago
2006
IEEE
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...
191
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
We propose in this paper an interactive segmentation algorithm based on curve evolution techniques. The task of automated segmentation has proven to be highly complex and applicat...