224 search results - page 37 / 45 » Multidimensional Data Structures and Techniques for Efficien... |
JSW
2008
13 years 8 months ago
2008
A recycling object is in its recycle chain and its status may often change according to recycling stage or reusing status; even its structure could often dynamically change accordi...
CASES
2010
ACM
13 years 6 months ago
2010
ACM
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
ICPR
2000
IEEE
14 years 9 months ago
2000
IEEE
We present a parallel implementation of a probabilistic algorithm for real time tracking of segments in noisy edge images. Given an initial solution ?a set of segments that reason...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...