9659 search results - page 61 / 1932 » Points on Computable Curves |
DIAGRAMS
2008
Springer
13 years 11 months ago
2008
Springer
Euler diagrams are a natural method of representing set-theoretic data and have been employed in diverse areas such as visualizing statistical data, as a basis for diagrammatic log...
ACSW
2007
13 years 11 months ago
2007
The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Such a problem turns out to be computati...
GD
2005
Springer
14 years 3 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
CAD
2007
Springer
13 years 9 months ago
2007
Springer
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
DCC
2005
IEEE
14 years 9 months ago
2005
IEEE
We consider the quotient of the Hermitian curve defined by the