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.
|Number of pages||2|
|State||Published - 2000|
|Event||11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA|
Duration: 9 Jan 2000 → 11 Jan 2000
|Conference||11th Annual ACM-SIAM Symposium on Discrete Algorithms|
|City||San Francisco, CA, USA|
|Period||9/01/00 → 11/01/00|