Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
This paper examines two seemingly unrelated qualitative spatial reasoning domains; geometric proportional analogies and topographic (landcover) maps. We present a Structure Matchin...
Diarmuid P. O'Donoghue, Amy J. Bohan, Mark T. Kean...
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
This paper studies the problem of 3D non-rigid shape and motion recovery from a monocular video sequence, under the degenerate deformations. The shape of a deformable object is re...