Real scaled matching

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. Scaled matching is an important problem that was originally inspired by problems in Vision. However, in real life, a more natural m...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 70; no. 4; pp. 185 - 190
Main Authors:	Amir, Amihood, Butman, Ayelet, Lewenstein, Moshe
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 28.05.1999 Elsevier Science Elsevier Sequoia S.A
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Analysis of algorithms Applied sciences Approximate pattern matching Combinatorial algorithms on words Computer science; control theory; systems Data processing. List processing. Character string processing Design of algorithm Exact sciences and technology Generalized pattern matching Information processing Language theory and syntactical analysis Memory organisation. Data processing Pattern matching Scaled pattern matching Software Studies Theoretical computing Design of algorithm Scaled pattern matching Combinatorial algorithms on words Analysis of algorithms Generalized pattern matching Pattern matching Approximate pattern matching Language theory Combinatorial problem Computational complexity String matching Word combinatorics Algorithm analysis
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!