178 search results - page 28 / 36 » Fast Algorithms for Top-k Approximate String Matching |
100
click to vote
SIGMOD
2011
ACM
14 years 8 days ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
100
Voted
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
WWW
2003
ACM
15 years 10 months ago
2003
ACM
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
73
Voted
ICRA
2007
IEEE
15 years 3 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...
ICDM
2008
IEEE
15 years 3 months ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...