4047 search results - page 419 / 810 » The Discrete Basis Problem |
141
click to vote
COMPGEOM
2004
ACM
16 years 7 days 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...
150
click to vote
HYBRID
2004
Springer
16 years 5 days ago
2004
Springer
This paper is driven by a general motto: bisimulate a hybrid system by a finite symbolic dynamical system. In the case of o-minimal hybrid systems, the continuous and discrete com...
177
click to vote
GMP
2003
IEEE
16 years 3 days 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...
174
click to vote
LICS
2003
IEEE
16 years 2 days ago
2003
IEEE
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...
143
click to vote
COMPGEOM
2003
ACM
16 years 2 days ago
2003
ACM
Let P be a set of n points in Rd. The radius of a k-dimensional flat F with respect to P, denoted by RD(F, P), is defined to be maxp∈P dist(F, p), where dist(F, p) denotes the...