We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
— We explore the advantages of intelligently dropping a small fraction of packets that arrive for transmission over a time varying wireless downlink. Without packet dropping, the...
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
An isosurface extraction algorithm which can directly generate multiresolution isosurfacesfrom volume data is introduced. It generates low resolution isosurfaces, with 4 to 25 tim...