501 search results - page 51 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
CP
2008
Springer
13 years 9 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
IJNSEC
2006
13 years 7 months ago
2006
This paper studies the security against differential/linear cryptanalysis and the pseudorandomness for a class of generalized Feistel scheme with SP round function called GFSP. We ...
COMPGEOM
2010
ACM
14 years 22 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...