88 search results - page 1 / 18 » Sublinear Algorithms for Parameterized Matching |
CPM
2006
Springer
13 years 9 months ago
2006
Springer
SODA
1994
ACM
13 years 6 months ago
1994
ACM
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
SODA
2010
ACM
13 years 3 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
IJFCS
2006
13 years 5 months ago
2006
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...