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!

Buďte první, kdo okomentuje tento záznam!