163 search results - page 6 / 33 » Optimal Correspondences from Pairwise Constraints |
115
Voted
AI
2008
Springer
15 years 14 days ago
2008
Springer
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
CGF
2008
15 years 13 days ago
2008
We present a robust and efficient algorithm for the pairwise non-rigid registration of partially overlapping 3D surfaces. Our approach treats non-rigid registration as an optimiza...
PODS
1999
ACM
15 years 4 months ago
1999
ACM
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all...
ICPP
2007
IEEE
15 years 6 months ago
2007
IEEE
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
FMCAD
2008
Springer
15 years 1 months ago
2008
Springer
Abstract-- We consider the problem of optimal netlist simplification in the presence of constraints. Because constraints restrict the reachable states of a netlist, they may enhanc...