Sciweavers

135 search results - page 9 / 27
» String Noninclusion Optimization Problems
Sort
View
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
15 years 4 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
EUROGP
2003
Springer
15 years 2 months ago
Evolving Finite State Transducers: Some Initial Explorations
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
Simon M. Lucas
VLDB
2005
ACM
118views Database» more  VLDB 2005»
15 years 3 months ago
Selectivity Estimation for Fuzzy String Predicates in Large Data Sets
Many database applications have the emerging need to support fuzzy queries that ask for strings that are similar to a given string, such as “name similar to smith” and “tele...
Liang Jin, Chen Li
ISCA
2005
IEEE
134views Hardware» more  ISCA 2005»
15 years 3 months ago
A High Throughput String Matching Architecture for Intrusion Detection and Prevention
Network Intrusion Detection and Prevention Systems have emerged as one of the most effective ways of providing security to those connected to the network, and at the heart of alm...
Lin Tan, Timothy Sherwood
IPPS
2010
IEEE
14 years 7 months ago
Head-body partitioned string matching for Deep Packet Inspection with scalable and attack-resilient performance
Abstract--Dictionary-based string matching (DBSM) is a critical component of Deep Packet Inspection (DPI), where thousands of malicious patterns are matched against high-bandwidth ...
Yi-Hua E. Yang, Viktor K. Prasanna, Chenqian Jiang