Sciweavers

237 search results - page 17 / 48
» Practical and Optimal String Matching
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Variable-Stride Multi-Pattern Matching For Scalable Deep Packet Inspection
Abstract—Accelerating multi-pattern matching is a critical issue in building high-performance deep packet inspection systems. Achieving high-throughputs while reducing both memor...
Nan Hua, Haoyu Song, T. V. Lakshman
SPIRE
2001
Springer
15 years 2 months ago
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. P...
ICFP
2010
ACM
14 years 10 months ago
Matching lenses: alignment and view update
Bidirectional programming languages are a practical approach to the view update problem. Programs in these languages, called lenses, define both a view and an update policy--i.e.,...
Davi M. J. Barbosa, Julien Cretin, Nate Foster, Mi...
ICDAR
2003
IEEE
15 years 2 months ago
Lexical Post-Processing Optimization for Handwritten Word Recognition
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...
Sabine Carbonnel, Éric Anquetil
RIAO
2007
14 years 11 months ago
Optimizations of Local Edition for Evaluating Similarity Between Monophonic Musical Sequences
Abstract: Melody is an important property for the perceptual description of Western musical pieces. In the monophonic context, retrieval systems based on melodic similarity general...
Pierre Hanna, Pascal Ferraro