501 search results - page 46 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
STOC
2012
ACM
11 years 10 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
DCG
2007
13 years 7 months ago
2007
Given a sphere of any radius r in an n-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the...
ESA
1994
Springer
13 years 11 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
MP
2008
13 years 7 months ago
2008
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
DLOG
2010
13 years 5 months ago
2010
Abstract. This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First,...