Sciweavers

DKE
2007
129views more  DKE 2007»
13 years 4 months ago
First-order temporal pattern mining with regular expression constraints
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting seque...
Sandra de Amo, Daniel A. Furtado
DEBU
2007
83views more  DEBU 2007»
13 years 4 months ago
Regular Expression Matching for Multi-script Databases
Modern database systems mostly support representation and retrieval of data belonging to different scripts and different languages. But the database functions are mostly designed ...
Sudeshna Sarkar
CORR
2010
Springer
132views Education» more  CORR 2010»
13 years 4 months ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis
DLT
2010
13 years 6 months ago
On the Average Number of States of Partial Derivative Automata
The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of th...
Sabine Broda, António Machiavelo, Nelma Mor...
FPL
2006
Springer
120views Hardware» more  FPL 2006»
13 years 8 months ago
Regular Expression Software Deceleration for Intrusion Detection Systems
The use of reconfigurable hardware for network security applications has recently made great strides as FPGA devices have provided larger and faster resources. Regular expressions...
Zachary K. Baker, Viktor K. Prasanna, Hong-Jip Jun...
CSR
2006
Springer
13 years 8 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
COCOON
2004
Springer
13 years 8 months ago
Regular Expressions for Languages over Infinite Alphabets
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if ...
Michael Kaminski, Tony Tan
ACSC
2004
IEEE
13 years 8 months ago
Formalization of UML Statechart Models Using Concurrent Regular Expressions
The Unified Modeling Language (UML) is widely used in the software development process for specification of system based on the object-oriented paradigm. Thought the current versi...
S. Jansamak, A. Surarerks
ANCS
2007
ACM
13 years 8 months ago
Compiling PCRE to FPGA for accelerating SNORT IDS
Deep Payload Inspection systems like SNORT and BRO utilize regular expression for their rules due to their high expressibility and compactness. The SNORT IDS system uses the PCRE ...
Abhishek Mitra, Walid A. Najjar, Laxmi N. Bhuyan
CPM
1998
Springer
132views Combinatorics» more  CPM 1998»
13 years 8 months ago
Reporting Exact and Approximate Regular Expression Matches
While much work has been done on determining if a document or a line of a document contains an exact or approximate match to a regular expression, less e ort has been expended in ...
Eugene W. Myers, Paulo Oliva, Katia S. Guimar&atil...