Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
Intrusion attempts due to self-propagating code are becoming an increasingly urgent problem, in part due to the homogeneous makeup of the internet. Recent advances in anomalybased...
Denver Dash, Branislav Kveton, John Mark Agosta, E...
By exploiting the object-oriented dynamic composability of modern document applications and formats, malcode hidden in otherwise inconspicuous documents can reach third-party appli...
Wei-Jen Li, Salvatore J. Stolfo, Angelos Stavrou, ...
Availability is a critical issue in modern distributed systems. While many techniques and protocols for preventing denial of service (DoS) attacks have been proposed and deployed ...
Preserving the availability and integrity of networked computing systems in the face of fast-spreading intrusions requires advances not only in detection algorithms, but also in a...
Saman A. Zonouz, Himanshu Khurana, William H. Sand...