4212 search results - page 371 / 843 » On Compressible Pairings and Their Computation |
158
click to vote
ESA
2004
Springer
16 years 8 days ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
149
click to vote
CAE
2007
15 years 9 months ago
2007
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...
161
click to vote
CONEXT
2008
ACM
15 years 8 months ago
2008
ACM
The current interdomain routing protocol, BGP, is not resilient to a path failure due to its single-path and slowlyconverging route calculation. This paper proposes a novel approa...
175
click to vote
CATS
2007
15 years 8 months ago
2007
For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the ...
204
click to vote
COMGEO
1999
ACM
15 years 6 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...