Sciweavers

140 search results - page 5 / 28
» Eliminating Dependent Pattern Matching
Sort
View
ICNP
2006
IEEE
15 years 3 months ago
High Speed Pattern Matching for Network IDS/IPS
— The phenomenal growth of the Internet in the last decade and society’s increasing dependence on it has brought along, a flood of security attacks on the networking and compu...
Mansoor Alicherry, Muthusrinivasan Muthuprasanna, ...
WCRE
1995
IEEE
15 years 1 months ago
Pattern Matching for Design Concept Localization
A legacy system is an operational, large-scale software system that is maintained beyond its first generation of programmers. It typically represents a massive economic investmen...
Kostas Kontogiannis, Renato de Mori, Morris Bernst...
JSA
2008
124views more  JSA 2008»
14 years 9 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
CADE
2003
Springer
15 years 10 months ago
Optimizing Higher-Order Pattern Unification
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculus based on modal type theory. This allows us to justify optimizations to pattern...
Brigitte Pientka, Frank Pfenning
RSA
2002
73views more  RSA 2002»
14 years 9 months ago
New and faster filters for multiple approximate string matching
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
Ricardo A. Baeza-Yates, Gonzalo Navarro