910 search results - page 33 / 182 » Detecting False Matches in String Matching Algorithms |
115
click to vote
AINA
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper we proposed a weighted suffix tree and find out it can improve the Intrusion Detection System (IDS). We firstly focus on the analysis of computer kernel system call,...
209
click to vote
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
127
Voted
CPM
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
138
click to vote
VL
1994
IEEE
15 years 7 months ago
1994
IEEE
Dotplot is a technique for visualizing patterns of string matches in millions of lines of text and code. Patterns may be explored interactively or detected automatically. Applicat...
130
Voted
SPIRE
2000
Springer
15 years 6 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...