4541 search results - page 36 / 909 » Cache-Oblivious Algorithms and Data Structures |
104
Voted
DAGSTUHL
1996
15 years 11 days ago
1996
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
MASCOTS
2001
15 years 12 days ago
2001
I/O is a major performance bottleneck in modern computer systems. Modern disks use the Zone-Bit-Recording (ZBR) technology to increase the capacity. A direct consequence of ZBR is...
127
click to vote
WFLP
2009
Springer
15 years 5 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
104
click to vote
GRAPHICSINTERFACE
2001
15 years 12 days ago
2001
We introduce a new acceleration to the standard splatting volume rendering algorithm. Our method achieves full colour (32-bit), depth-sorted and shaded volume rendering significan...
88
Voted
CCCG
2010
15 years 15 days ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...