—In this paper we consider Quasi-Birth-and-Death (QBD) processes where the upward (resp. downward) transitions are restricted to occur only from (resp. to) a subset of the phase ...
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
This paper proposes a fast and accurate method to detect all nearduplicate segments in a video stream. To reduce the computation time while ensuring the detection accuracy equival...
— We consider several object sharing synchronization mechanisms including lock-based, lock-free, and wait-free sharing for LNREF [1], an optimal real-time scheduling algorithm on...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
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...