Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...