Program slicing has been used for efficient program debugging activities. Program slice is computed by analyzing dependence relations between program statements. We can divide dep...
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
Shlomo Zilberstein, Abdel-Illah Mouaddib, Andrew A...
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
We propose an efficient framework for dynamic cloud rendering. Base on the proposed simplified lighting model, the Shadow Relation Table (SRT) and Metaball Lighting Texture Databa...
In this work we propose a model for video scenes that contain temporal variability in shape and appearance. We propose a conditionally linear model akin to a dynamic extension of ...