141 search results - page 4 / 29 » Explicitly Parallel Regular Expressions |
ICS
2009
Tsinghua U.
14 years 1 months ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
ICS
2010
Tsinghua U.
13 years 11 months ago
2010
Tsinghua U.
We explore the intersection between an emerging class of architectures and a prominent workload: GPGPUs (General-Purpose Graphics Processing Units) and regular expression matching...
COLING
1996
13 years 8 months ago
1996
This paper extends the calculus of regular expressions with new types of replacement expressions that enhance the expressiveness of the simple replace operator defined in Karttune...
INFOCOM
2011
IEEE
12 years 10 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....
APPML
2007
13 years 7 months ago
2007
In this work, kinds of Marr-type wavelets Ψn(t) are obtained and an explicit expression for the wavelets is derived. Time–frequency analysis shows that, regarded as window func...