36 search results - page 5 / 8 » Experiments on String Matching in Memory Structures |
127
click to vote
FPL
2005
Springer
15 years 8 months ago
2005
Springer
String pattern matching is a computationally expensive task, and when implemented in hardware, it can consume a large amount of resources for processing and storage. This paper pr...
154
click to vote
STRINGOLOGY
2004
15 years 3 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
141
Voted
ICDAR
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper presents a lexical post-processing optimization for handwritten word recognition. The aim of this work is to explore the combination of different lexical postprocessing...
117
Voted
ICNP
2007
IEEE
15 years 8 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
135
Voted
EMSOFT
2006
Springer
15 years 6 months ago
2006
Springer
Portable systems such as cell phones and portable media players commonly use non-volatile RAM (NVRAM) to hold all of their data and metadata, and larger systems can store metadata...