242 search results - page 5 / 49 » A SAT-Based Algorithm for Context Matching |
ACIVS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
ISAAC
2004
Springer
14 years 25 days ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper presents a probabilistic framework for computing correspondences and fundamental matrix in the structure from motion problem. Inspired by Moisan and Stival [1], we sugg...
DLOG
2003
13 years 8 months ago
2003
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
PAMI
2006
13 years 7 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...