Sciweavers

22 search results - page 1 / 5
» On a generalization of triangulated graphs for domains decom...
Sort
View
IJCAI
2003
13 years 5 months ago
On a generalization of triangulated graphs for domains decomposition of CSPs
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
Assef Chmeiss, Philippe Jégou, Lamia Keddar
ICTAI
2009
IEEE
13 years 1 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
AI
2003
Springer
13 years 8 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
DAGM
2003
Springer
13 years 8 months ago
Domain Decomposition for Parallel Variational Optical Flow Computation
We present an approach to parallel variational optical flow computation by using an arbitrary partition of the image plane and iteratively solving related local variational proble...
Timo Kohlberger, Christoph Schnörr, Andr&eacu...
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 1 months ago
Counting Plane Graphs: Flippability and its Applications
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csab...