Sciweavers

ACG
2009
Springer
13 years 11 months ago
Plans, Patterns, and Move Categories Guiding a Highly Selective Search
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
Gerhard Trippen
LATA
2009
Springer
13 years 11 months ago
Counting Parameterized Border Arrays for a Binary Alphabet
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
FPGA
2009
ACM
285views FPGA» more  FPGA 2009»
13 years 11 months ago
PERG-Rx: a hardware pattern-matching engine supporting limited regular expressions
PERG is a pattern matching engine designed for locating predefined byte string patterns (rules) from the ClamAV virus signature database in a data stream. This paper presents PERG...
Johnny Tsung Lin Ho, Guy G. Lemieux
SIGMOD
2008
ACM
161views Database» more  SIGMOD 2008»
14 years 4 months ago
Efficient pattern matching over event streams
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Ne...
POPL
2009
ACM
14 years 5 months ago
Focusing on pattern matching
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
Neelakantan R. Krishnaswami
DAC
2002
ACM
14 years 5 months ago
A flexible accelerator for layer 7 networking applications
In this paper, we present a flexible accelerator designed for networking applications. The accelerator can be utilized efficiently by a variety of Network Processor designs. Most ...
Gokhan Memik, William H. Mangione-Smith
DAC
2007
ACM
14 years 5 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
DAC
2008
ACM
14 years 5 months ago
Design of high performance pattern matching engine through compact deterministic finite automata
Pattern matching relies on deterministic finite automata (DFA) to search for predefined patterns. While a bit-DFA method is recently proposed to exploit the parallelism in pattern...
Piti Piyachon, Yan Luo
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 5 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Mirit Shalem, Ziv Bar-Yossef