136 search results - page 8 / 28 » Greedy Regular Expression Matching |
GCB
2000
Springer
15 years 1 months ago
2000
Springer
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...
ICTAC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
169
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
We present an efficient algorithm for regular expression matching on streams with out of order data, while maintaining a small state and without complete stream reconstruction. We...
ICFP
2004
ACM
15 years 9 months ago
2004
ACM
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
116
click to vote
TIT
2010
14 years 4 months ago
2010
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...