9532 search results - page 189 / 1907 » Logic, Graphs, and Algorithms |
130
click to vote
PAMI
1998
15 years 4 months ago
1998
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
135
click to vote
VIP
2003
15 years 5 months ago
2003
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...
147
click to vote
ECCC
2006
15 years 4 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
202
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...
129
click to vote
FOCI
2007
IEEE
15 years 11 months ago
2007
IEEE
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...