We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Mo...
Maintaining the best quality is essential for the survival of a company in a globally competitive world. Six Sigma activity has been widely accepted as one of the most efficient a...
As multi-core processor systems become more and more widespread, the demand for efficient parallel algorithms also propagates into the field of computer graphics. This is especial...
Bernhard Thomaszewski, Simon Pabst, Wolfgang Bloch...
The technological advance of sensors is producing an exponential size growth of the data coming from 3D scanning and digital photography. The production of digital 3D models consi...
Marco Callieri, Paolo Cignoni, Massimiliano Corsin...