2127 search results - page 61 / 426 » Computing large matchings fast |
141
Voted
COMGEO
2004
ACM
15 years 3 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
122
Voted
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— Many computer vision problems such as recognition, image retrieval, and tracking require matching two images. Currently, ones try to find as reliable as possible match...
117
click to vote
SIGIR
1998
ACM
15 years 7 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
122
click to vote
CVPR
1998
IEEE
16 years 5 months ago
1998
IEEE
The problem considered in this paper is that of estimating the projective transformation between two images in situations where the image motion is large and featurematching is no...
136
Voted
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
In this work, we address the problem of building recognition across two camera views with large changes in scales and viewpoints. The main idea is to construct a semantically rich...