𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Optimum-Path Forest framework for intrusion detection in computer networks

✍ Scribed by Pereira, Clayton R.; Nakamura, Rodrigo Y.M.; Costa, Kelton A.P.; Papa, João P.

Book ID
119237467
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
207 KB
Volume
25
Category
Article
ISSN
0952-1976

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithm for finding optimum path in
An Algorithm for finding optimum path in networks
✍ Kabekode V.S. Bhat 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 242 KB

In this paper we present an O((V( . loglV() algorithm forfinding an optimum path between two nodes in an edge-sparse network using a new approach. The method exploits the data structure and a simple breadth-first search process.

[Lecture Notes in Computer Science] Rece
[Lecture Notes in Computer Science] Recent Advances in Intrusion Detection Volume 2820 || Modeling Computer Attacks: An Ontology for Intrusion Detection
✍ Vigna, Giovanni; Kruegel, Christopher; Jonsson, Erland 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 247 KB

This Book Constitutes The Refereed Proceedings Of The 6th International Symposium On Recent Advances In Intrusion Detection, Raid 2003, Held In Pittsburgh, Pa, Usa In September 2003. The 13 Revised Full Papers Presented Were Carefully Reviewed And Selected From 44 Submissions. The Papers Are Organiz