62 search results - page 3 / 13 » Approximating general metric distances between a pattern and... |
JDA
2011
13 years 17 days ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
CPM
2009
Springer
14 years 5 days ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
ICCV
1998
IEEE
13 years 10 months ago
1998
IEEE
One of the key problems in appearance-based vision is understanding how to use a set of labeled images to classify new images. Classification systems that can model human performa...
CPM
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...