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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 70; číslo 4; s. 185 - 190
Hlavní autoři: Amir, Amihood, Butman, Ayelet, Lewenstein, Moshe
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 28.05.1999
Elsevier Science
Elsevier Sequoia S.A
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 model of scaled matching is the real scaled matching model. Real scaled matching is an extended version of the scaled matching problem allowing arbitrary real-sized scales, approximated by some function, e.g., truncation. It has been shown that the scaled matching problem 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 show how to solve the real scaled matching problem in linear time.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(99)00060-5