We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
A variety of performance-enhancing techniques, such as striping, mirroring, and rotational data replication, exist in the disk array literature. Given a fixed budget of disks, one...
Xiang Yu, Benjamin Gum, Yuqun Chen, Randolph Y. Wa...
In this work, we present a new method for generating a threshold structure. This kind of structure can be advantageously used in various halftoning algorithms such as clustered-do...
We consider a monopolist expert offering a service with a `credence' characteristic. A credence service is one where the customer cannot verify, even after a purchase, whethe...
Laurens G. Debo, L. Beril Toktay, Luk N. Van Wasse...
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...