42 search results - page 5 / 9 » An improved DFA for fast regular expression matching |
ICS
2009
Tsinghua U.
14 years 2 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...
EVOW
2004
Springer
13 years 11 months ago
2004
Springer
A number of bioinformatics tools use regular expression (RE) matching to locate protein or DNA sequence motifs that have been discovered by researchers in the laboratory. For exam...
ISEUD
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Inputs to web forms often contain typos or other errors. However, existing web form design tools require end-user developers to write regular expressions (“regexps”) ...
TIP
2008
13 years 7 months ago
2008
We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the 1 -norm of the wavelet coefficients of the solution. ...
TREC
2004
13 years 8 months ago
2004
This paper describes the participation of the School of Informatics, University of Wales, Bangor in the 2004 Text Retrieval Conference. We present additions and modications to the...