This paper is concerned with the problem of dynamically reconstructing the 3D surface of an object undergoing non-rigid motion. The problem is cast as reconstructing a continuous ...
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...