The Extension of the Aho-Corasick Algorithm to Multiple Rectangular Pattern Arrays of Different Sizes and N-Dimensional Cases
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we first show that multiple rectangular pattern arrays of various sizes can be efficiently recognized by extending the idea proposed in the AC algorithm, then demonstrate such a method permits extension to arrays of arbitrarily many dimensions. Both the running time and preprocessing time of our algorithms are proved to be linear. Possible applications are foreseen to problems such as detection of edges in digital pictures and in the field of computer graphics.
- 一般社団法人情報処理学会の論文
- 1989-03-08
著者
-
Takaoka Tadao
Department Of Computer Science Ibaraki University
-
Zhu Rui
Department Of Information Science Ibaraki University
-
Takaoka Tadao
Department Of Information Science Ibaraki University
-
Takaoka Tadao
Department of Computer Science and Software Engineering University of Canterbury
関連論文
- A Parallel Algorithm for the Longest Path Problem on Acyclic Graphs with Integer Arc Lengths
- A Systematic Approach to Parallel Program Verification
- On Improving the Average Case of the Boyer-Moore String Matching Algorithm
- Surface properties and depth analysis of polyethylene/polydimethylsiloxane composite prepared by using supercritical carbon dioxide
- Parallel Algorithms for a Class of Graph Theoretic Problems
- The Extension of the Aho-Corasick Algorithm to Multiple Rectangular Pattern Arrays of Different Sizes and N-Dimensional Cases
- Entropy as Computational Complexity
- An O(n(n^2/p+log p)) Parallel Algorithm to Compute the All Pairs Shortest Paths and the Transitive Closure
- Preparation of Nanometer Dispersed Semicrystalline/Amorphous Polymer Pseudo-interpenetrating Network Using Supercritical Carbon Dioxide as a Swelling Agent
- Aberrantly increased mRNA expression of betaglycan, an inhibin co-receptor in the ovarian tissues in women with polycystic ovary syndrome