1245 search results - page 188 / 249 » Triangulation for Points on Lines |
112
click to vote
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
RSP
2003
IEEE
15 years 3 months ago
2003
IEEE
We describe cache architecture, intended for prototype-oriented IC platforms, that automatically finds the best cache configuration for a particular application. The cache itself ...
3DPVT
2002
IEEE
15 years 2 months ago
2002
IEEE
A method for reconstruction of 3D polygonal models from multiple views is presented. The method uses sampling techniques to construct a texture-mapped semi-regular polygonal mesh ...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
GD
2001
Springer
15 years 2 months ago
2001
Springer
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...