11784 search results - page 444 / 2357 » Interpolation for data structures |
184
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be descr...
186
click to vote
ECAI
2004
Springer
16 years 7 days ago
2004
Springer
Model-based diagnosis applied to computer programs has been studied for several years. Although there are still weaknesses in the used models, especially on dealing with dynamic da...
185
click to vote
WAE
2001
15 years 8 months ago
2001
Abstract. A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays, each of which is a blockwiseallocated pil...
164
click to vote
SSD
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
176
click to vote
ECLIPSE
2005
ACM
15 years 8 months ago
2005
ACM
Developing Eclipse plug-ins often involves the creation of data structures and corresponding data processing code. In developing eAssignment, an Eclipse-bases application to suppo...