11211 search results - page 415 / 2243 » Rank-Sensitive Data Structures |
165
click to vote
ICLP
1999
Springer
15 years 11 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
181
Voted
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...
185
Voted
SIAMCOMP
1998
15 years 6 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
180
click to vote
ECAI
2004
Springer
16 years 4 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...