237 search results - page 19 / 48 » Practical and Optimal String Matching |
IWANN
2005
Springer
14 years 8 days ago
2005
Springer
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
CPM
2007
Springer
13 years 10 months ago
2007
Springer
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
IOPADS
1997
13 years 8 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
ISCAS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— Several network security and QoS applications require detecting multiple string matches in the packet payload by comparing it against predefined pattern set. This proc...
ICB
2007
Springer
13 years 10 months ago
2007
Springer
Fusion is a popular practice to increase the reliability of the biometric verification. In this paper, optimal fusion at decision level by AND rule and OR rule is investigated. Bot...