169 search results - page 21 / 34 » Pattern Matching in Text Compressed by Using Antidictionarie... |
FPL
2003
Springer
14 years 21 days ago
2003
Springer
Intrusion Detection Systems such as Snort scan incoming packets for evidence of security threats. The most computation-intensive part of these systems is a text search against hund...
HIS
2001
13 years 8 months ago
2001
Abstract. Linear Discriminant (LD) techniques are typically used in pattern recognition tasks when there are many (n >> 104 ) datapoints in low-dimensional (d < 102 ) spac...
NLPRS
2001
Springer
13 years 12 months ago
2001
Springer
We introduce a new incremental search method called Migemo for languages with many character faces. Migemo performs the incremental search by dynamically expanding the input patte...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...