Zobrazeno 1 - 10
of 223
pro vyhledávání: '"Boyer–Moore–Horspool algorithm"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ameedeen M. A., Chung Hoong Chan
Publikováno v:
Advanced Science Letters. 23:11387-11390
After a deep view on few fast searching algorithm as Boyer-Moore algorithm, Boyer-Moore Horspool algorithm, Brute-Force Algorithm, Knuth-Morris-Pratt algorithm and Rabin-Karp algorithm, this research paper chooses Boyer-Moore Horspool algorithm to us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b206573de52ccda0e06df94f284cfed6
https://doi.org/10.1166/asl.2017.10289
https://doi.org/10.1166/asl.2017.10289
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dai Hong
Publikováno v:
Journal of Convergence Information Technology. 7:70-76
In computer science, the Boyer–Moore–Horspool algorithm is an algorithm for finding substrings in strings. A pattern matching problem can be classified into software and hardware based on implemental methods. It is important of enhance pattern ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b98965e924fc690595eafe106681c9a
https://doi.org/10.4156/jcit.vol7.issue4.9
https://doi.org/10.4156/jcit.vol7.issue4.9
Multi-Pattern Boyer-Moore - Horspool Algorithm based Hashing Function for Intrusion Detection System
Publikováno v:
Lecture Notes on Information Theory. 1:69-72
Every day the networks are expanding in very large scale and running in very high speed. The Intrusion Detection System (IDS) becomes as an essential part in any new network structure. The IDS is relying on the string matching algorithm to detect any
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d76e5043f1d13620c71fdb50a1ee0b66
https://doi.org/10.12720/lnit.1.2.69-72
https://doi.org/10.12720/lnit.1.2.69-72
Autor:
Nebel, Markus, Vöcking, Berthold
Publikováno v:
Algorithms Unplugged ISBN: 9783642153273
Algorithms Unplugged
Algorithms Unplugged
This chapter considers the problem of searching in texts. More precisely, we have to determine whether a given string is contained in some text. A human being can determine this efficiently for short search strings and a text that is not too long, bu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ace8953971b17c9d701666bb78890151
https://pub.uni-bielefeld.de/record/2910024
https://pub.uni-bielefeld.de/record/2910024
Autor:
Mireille Régnier, Ricardo Baeza-Yates
Publikováno v:
Theoretical Computer Science. 92(1):19-31
We study Boyer-Moore-type string searching algorithms. We analyze the Horspool's variant. The searching time is linear. An exact expression of the linearity constant is derived and is proven to be asymptotically α, 1 c ⩽α⩽ 2 (c + 1) , where c i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be643d0088f670e9fbf42de7c0fa39c1
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
South African Computer Journal. 41:13-20
The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been suggested. Watson and Zwaan in the early 1990s derived a set of well-known solutions from a common starting point, leading to a t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___01180::b00980b2b6232917c125d6e7454d9c13
https://research.tue.nl/en/publications/42a9205a-60d9-4753-ab68-8968e5cd5ebf
https://research.tue.nl/en/publications/42a9205a-60d9-4753-ab68-8968e5cd5ebf
Autor:
Cleophas, L.G.W.A., Watson, B.W.
Publikováno v:
South African Computer Journal, 41, 13-20. South African Institute of Computer Scientists and Information Technologists
The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been suggested. Watson and Zwaan in the early 1990s derived a set of well-known solutions from a common starting point, leading to a t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::b0ff0d4f55c90e33a0c5bfa3f90a33e5
https://research.tue.nl/nl/publications/42a9205a-60d9-4753-ab68-8968e5cd5ebf
https://research.tue.nl/nl/publications/42a9205a-60d9-4753-ab68-8968e5cd5ebf