Sign in
Back
Signature Generation Algorithms for Polymorphic Worms
Book chapter

Signature Generation Algorithms for Polymorphic Worms

Mohssen Mohammed and Al-Sakib Khan Pathan
Automatic Defense Against Zero-day Polymorphic Worms in Communication Networks, pp.169-260
CRC Press, 2
2013
DOI: https://doi.org/10.1201/b14912-7

Abstract

Single Layer Perceptron Approximate String Matching Linear Gaussian SSMs Factor Nodes Training Data Junction Tree Algorithm Conditional Independence Relations Undirected Graphical Model Dynamic Programming Conditional Independence Relationships Normalized Information Gain Undirected Graph Graphical Models RBF Network Hidden Variables Probabilistic PCA CI ICA Factor Graphs Junction Tree BP Algorithm Supervise Ml Unsupervised Learning Brute Force Algorithm Polymorphic Worms
String matching [1] is an important subject in the wider domain of text processing. String-matching algorithms are the basic components used for implementations of practical software used in most available operating systems. Moreover, they emphasize programming methods that serve as paradigms in other fields of computer science (system or software design). They also play an important role in theoretical computer science by providing challenging problems.

Metrics

1 Record Views

Details