1672 search results - page 166 / 335 » Tightness problems in the plane |
COMPGEOM
2004
ACM
15 years 4 months ago
2004
ACM
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
COCOON
2004
Springer
15 years 4 months ago
2004
Springer
An octree is a recursive partition of the unit cube, such that in each step a cube is subdivided into eight smaller cubes. Those cubes that are not further subdivided are the leave...
EUROCRYPT
2004
Springer
15 years 4 months ago
2004
Springer
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
SPW
2004
Springer
15 years 4 months ago
2004
Springer
abstract February 6, 2004 Security protocols typically employ an authentication phase followed by a protected data exchange. In some cases, such TLS, these two phases are tightly ...
GMP
2003
IEEE
15 years 4 months ago
2003
IEEE
Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this c...