Sciweavers

42 search results - page 7 / 9
» An improved DFA for fast regular expression matching
Sort
View
SIGIR
1998
ACM
13 years 11 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
BMCBI
2007
115views more  BMCBI 2007»
13 years 7 months ago
A novel, fast, HMM-with-Duration implementation - for application with a new, pattern recognition informed, nanopore detector
Background: Hidden Markov Models (HMMs) provide an excellent means for structure identification and feature extraction on stochastic sequential data. An HMM-with-Duration (HMMwD) ...
Stephen Winters-Hilt, Carl Baribault
ECOOP
2007
Springer
14 years 1 months ago
A Staged Static Program Analysis to Improve the Performance of Runtime Monitoring
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Our work is based on tracematches, an extension to...
Eric Bodden, Laurie J. Hendren, Ondrej Lhotá...
SEMWEB
2009
Springer
13 years 12 months ago
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
JEI
2000
134views more  JEI 2000»
13 years 7 months ago
Pattern matching using the blur hit - miss transform
The usefulness of the hit-miss transform (HMT) and related transforms for pattern matching in document image applications is examined. Although the HMT is sensitive to the types o...
Dan S. Bloomberg, Luc Vincent