Keyword : string matching


Regular Expression Filtering on Multiple q-Grams
Seon-Ho SHIN HyunBong KIM MyungKeun YOON 
Publication:   
Publication Date: 2018/01/01
Vol. E101-D  No. 1 ; pp. 253-256
Type of Manuscript:  LETTER
Category: Information Network
Keyword: 
regular expressionstring matchingq-gramintrusion detectiondeep packet inspection
 Summary | Full Text:PDF

A Finite Automaton-Based String Matching Engine on Graphic Processing Unit
JinMyung YOON Kang-Il CHOI HyunJin KIM 
Publication:   
Publication Date: 2017/09/01
Vol. E100-A  No. 9 ; pp. 2031-2033
Type of Manuscript:  LETTER
Category: VLSI Design Technology and CAD
Keyword: 
graphic processing unitnon-deterministic finite automatonshared memorystring matching
 Summary | Full Text:PDF

Asymmetric Sparse Bloom Filter
MyungKeun YOON JinWoo SON Seon-Ho SHIN 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 2014/04/01
Vol. E97-B  No. 4 ; pp. 765-772
Type of Manuscript:  PAPER
Category: Internet
Keyword: 
Bloom filtermembership testingstring matchingvirus scanning
 Summary | Full Text:PDF

A Memory-Efficient Bit-Split Pattern Matching Architecture Using Shared Match Vectors for Deep Packet Inspection
HyunJin KIM 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 2012/11/01
Vol. E95-B  No. 11 ; pp. 3594-3596
Type of Manuscript:  LETTER
Category: Network Management/Operation
Keyword: 
computer network securitydeep packet inspectionfinite state machinestring matchingnetwork monitoring
 Summary | Full Text:PDF

A Dynamically Reconfigurable FPGA-Based Pattern Matching Hardware for Subclasses of Regular Expressions
Yusaku KANETA Shingo YOSHIZAWA Shin-ichi MINATO Hiroki ARIMURA Yoshikazu MIYANAGA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2012/07/01
Vol. E95-D  No. 7 ; pp. 1847-1857
Type of Manuscript:  PAPER
Category: Computer System
Keyword: 
FPGAstring matchingregular expression matchingbit-parallel algorithmevent stream processing
 Summary | Full Text:PDF

Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet
Tomohiko UYEMATSU Fumio KANAYA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/10/01
Vol. E89-A  No. 10 ; pp. 2459-2465
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Source Coding
Keyword: 
countably infinite alphabetergodic sourceincremental parsingLempel-Ziv codestring matching
 Summary | Full Text:PDF

On the Asymptotic Behaviors of the Recurrence Time with Fidelity Criterion for Discrete Memoryless Sources and Memoryless Gaussian Sources
Hiroki KOGA Suguru ARIMOTO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1998/05/25
Vol. E81-A  No. 5 ; pp. 981-986
Type of Manuscript:  LETTER
Category: Information Theory and Coding Theory
Keyword: 
lossy data compressionLempel-Ziv coderecurrence time fidelity criterionstring matching
 Summary | Full Text:PDF

A Linear Time Pattern Matching Algorithm between a String and a Tree
Tatsuya AKUTSU 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1994/03/25
Vol. E77-D  No. 3 ; pp. 281-287
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
subtreesubgraph isomorphismstring matchingsuffix treegraph algorithms
 Summary | Full Text:PDF