Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
We present a surface compression method that stores surfaces as wavelet-compressed signed-distance volumes. Our approach enables the representation of surfaces with complex topolo...
Daniel E. Laney, Martin Bertram, Mark A. Duchainea...
This paper argues about the deployment positions of Network-based Intrusion Detection System and suggests the "Distributed Network Security Sensors" distributed among the...
Network patterns are based on generic algorithms that execute on tree-based overlays. A set of such patterns has been developed at KTH to support distributed monitoring in network...
Opportunistic activity and context recognition systems do not presume a static sensor infrastructure that is defined at the design time of a system. They also do not have a fixed ...