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...
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...
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...
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...
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...