9659 search results - page 67 / 1932 » Points on Computable Curves |
ALENEX
2003
15 years 1 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
CAGD
2010
15 years 3 hour ago
2010
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the p...
DCC
2010
IEEE
14 years 12 months ago
2010
IEEE
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
ICIP
2009
IEEE
16 years 28 days ago
2009
IEEE
Computerized analysis of paintings has recently gained interest. The rapid technological advancements and the expanding interdisciplinary collaboration present us a promising pros...
104
click to vote
WAIFI
2007
Springer
15 years 6 months ago
2007
Springer
We propose a simple and efficient deterministic extractor for the (hyper)elliptic curve C, defined over Fq2 , where q is some power of an odd prime. Our extractor, for a given poi...