26 search results - page 4 / 6 » On degrees in random triangulations of point sets |
SMI
2003
IEEE
14 years 23 days ago
2003
IEEE
This paper proposes a digital watermarking algorithm for 2D vector digital maps. The watermark is a robust, informed-detection watermark to be used to prevent such abuses as an in...
IJRR
2002
13 years 7 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
BROADNETS
2007
IEEE
14 years 1 months ago
2007
IEEE
—Epidemic protocols assume that information of a random set of nodes is provided at each protocol round. By definition, the random set needs to be chosen uniformly and randomly ...
COMPGEOM
1994
ACM
13 years 11 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...