Sciweavers

1612 search results - page 11 / 323
» Asynchronous Pattern Matching
Sort
View
DCC
1998
IEEE
15 years 1 months ago
Multiple Pattern Matching in LZW Compressed Text
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Mas...
FCT
2005
Springer
15 years 3 months ago
A New Linearizing Restriction in the Pattern Matching Problem
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
Yo-Sub Han, Derick Wood
ISCAS
2008
IEEE
102views Hardware» more  ISCAS 2008»
15 years 4 months ago
Asynchronous balanced gates tolerant to interconnect variability
Abstract— Existing methods of gate level power attack countermeasures depend on exact capacitance matching of the dual-rail data outputs of each gate. Process variability and a l...
Konrad J. Kulikowski, Vyas Venkataraman, Zhen Wang...
DAC
2007
ACM
15 years 10 months ago
Compact State Machines for High Performance Pattern Matching
Pattern matching is essential to a wide range of applications such as network intrusion detection, virus scanning, etc. Pattern matching algorithms normally rely on state machines...
Piti Piyachon, Yan Luo
COMPSAC
2002
IEEE
15 years 2 months ago
A Dictionary-Based Compressed Pattern Matching Algorithm
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...
Meng-Hang Ho, Hsu-Chun Yen