1483 search results - page 144 / 297 » Geometric constraint satisfaction using optimization methods |
109
click to vote
CVIU
2004
15 years 2 months ago
2004
In this paper we address the problem of matching two images with two different resolutions: a high-resolution image and a low-resolution one. The difference in resolution between ...
105
click to vote
ISSS
1997
IEEE
15 years 7 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
108
click to vote
JAIR
2008
15 years 2 months ago
2008
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
123
click to vote
SCP
1998
15 years 2 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
143
Voted
JMLR
2006
15 years 2 months ago
2006
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...