62 search results - page 1 / 13 » Approximating general metric distances between a pattern and... |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
TODS
2002
13 years 7 months ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...