We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
: This work is on development of a method for automatic registration of satellite images acquired on different dates, for both geometric and radiometric correction with respect to ...
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
In this article we propose an original reversible method for discrete surface smoothing. This method is based on a statistical estimation of the discrete tangent plane on the voxe...