4415 search results - page 183 / 883 » How to Pair with a Human |
156
click to vote
ERCIMDL
2008
Springer
15 years 8 months ago
2008
Springer
One of the main challenges in integrating two hierarchies is determining the correspondence between the edges of each hierarchy. Traditionally, this process, which we call hierarch...
142
click to vote
VMV
2008
15 years 7 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
171
click to vote
DCG
2008
15 years 6 months ago
2008
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
157
click to vote
TIP
2008
15 years 6 months ago
2008
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...
169
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper we show how a segmentation as preprocessing paradigm can be used to improve the efficiency and accuracy of model search in an image. We operationalize this idea usin...