480 search results - page 47 / 96 » connection 2002 |
ALGORITHMICA
2002
13 years 8 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
CG
2002
Springer
13 years 8 months ago
2002
Springer
: In raster graphics, a line is displayed as a sequence of connected pixels that best approximate the line with minimum deviation. The displacement code of a line is a sequence of ...
CGF
2002
13 years 8 months ago
2002
This paper presents a robust watermarking algorithm with informed detection for 3D polygonal meshes. The algorithm is based on our previous algorithm [22] that employs mesh-spectr...
COLING
2002
13 years 8 months ago
2002
We present a principled approach to the problem of connecting a controlled document authoring system with a knowledge base. We start by describingclosed-world authoring situations...
COMBINATORICS
2002
13 years 8 months ago
2002
Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues...