230 search results - page 7 / 46 » The Inclusion Problem for Regular Expressions |
VLDB
1999
ACM
15 years 3 months ago
1999
ACM
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
113
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
117
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
APLAS
2006
ACM
15 years 5 months ago
2006
ACM
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...