Real Scaled Matching

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations


Scaled Matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary integral scale, appears. Real Scaled Matching is the extended problem allowing arbitrary real-sized scales, approximated by some function, e.g. truncation. Scaled matching, originally inspired by problems in Vision, can be solved in linear time. However, even though there has been follow-up work on the problem, it remained an open question whether real scaled matching could be solved faster than the simple solution of O(nm) time, where n is the text size and m is the pattern size. Using a new approach we solve the real scaled matching problem in linear time.

Original languageEnglish
Number of pages2
StatePublished - 2000
Event11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: 9 Jan 200011 Jan 2000


Conference11th Annual ACM-SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA


Dive into the research topics of 'Real Scaled Matching'. Together they form a unique fingerprint.

Cite this