Sciweavers

1483 search results - page 144 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
CVIU
2004
96views more  CVIU 2004»
15 years 1 months ago
Image matching with scale adjustment
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 ...
Yves Dufournaud, Cordelia Schmid, Radu Horaud
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 5 months ago
Reducing the Complexity of ILP Formulations for Synthesis
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...
Anne Mignotte, Olivier Peyran
JAIR
2008
110views more  JAIR 2008»
15 years 1 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
SCP
1998
107views more  SCP 1998»
15 years 29 days ago
A Distributed Arc-Consistency Algorithm
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...
T. Nguyen, Yves Deville
JMLR
2006
169views more  JMLR 2006»
15 years 1 months ago
Bayesian Network Learning with Parameter Constraints
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...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...