For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
—We consider connection-level models of resource allocation in the Internet, where files arrive into the network according to a Poisson process and the size of each file is exp...
We describe our studies on summarising surveillance videos using optical flow information. The proposed method incorporates motion analysis into a video skimming scheme in which ...
Jian Li, Stavri G. Nikolov, Christopher P. Benton,...
This paper proposes OctMesh, an interactive mesh browsing scheme over the Internet. In OctMesh, a large-scale mesh is encoded into one bit-stream, which is organized with respect ...
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...