Sciweavers

11213 search results - page 417 / 2243
» Low-contention data structures
Sort
View
ECAI
2004
Springer
16 years 7 days ago
Introducing Alias Information into Model-Based Debugging
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...
Daniel Köb, Franz Wotawa
WAE
2001
236views Algorithms» more  WAE 2001»
15 years 8 months ago
Experiences with the Design and Implementation of Space-Efficient Deques
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...
Jyrki Katajainen, Bjarke Buur Mortensen
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
15 years 6 months ago
Dynamic Trees and Dynamic Point Location
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...
Michael T. Goodrich, Roberto Tamassia
SSD
1995
Springer
97views Database» more  SSD 1995»
15 years 10 months ago
Ranking in Spatial Databases
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...
Gísli R. Hjaltason, Hanan Samet
ECLIPSE
2005
ACM
15 years 8 months ago
eAssignment: a case for EMF
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...
Marcel Bruch, Christoph Bockisch, Thorsten Sch&aum...