683 search results - page 6 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
IGIS
1994
13 years 11 months ago
1994
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
AMC
2006
13 years 7 months ago
2006
Dynamic models of elastic structures are derived using approximations of linear three dimensional elasticity. A model for the three dimensional motion of a nonsymmetric structure ...
KBSE
1997
IEEE
13 years 12 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...