Sciweavers

1525 search results - page 6 / 305
» Matching with Regular Constraints
Sort
View
ACSC
2005
IEEE
14 years 1 months ago
Large k-Separated Matchings of Random Regular Graphs
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
Mihalis Beis, William Duckworth, Michele Zito
RAID
2009
Springer
14 years 1 months ago
Regular Expression Matching on Graphics Hardware for Intrusion Detection
The expressive power of regular expressions has been often exploited in network intrusion detection systems, virus scanners, and spam filtering applications. However, the flexibl...
Giorgos Vasiliadis, Michalis Polychronakis, Spyros...
APIN
2000
103views more  APIN 2000»
13 years 7 months ago
Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...
Brian J. Ross
DBPL
2005
Springer
135views Database» more  DBPL 2005»
14 years 27 days ago
Type-Based Optimization for Regular Patterns
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
Michael Y. Levin, Benjamin C. Pierce
FSTTCS
1998
Springer
13 years 11 months ago
Optimal Regular Tree Pattern Matching Using Pushdown Automata
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
Maya Madhavan, Priti Shankar