Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...
Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey...
This is an algorithm for finding neighbors for point objects that can freely move and have no predefined position. The query sphere consists of a center location and a given radiu...
The number of successful attacks on the Internet shows that it is very difficult to guarantee the security of online search engines. A breached server that is not detected in time...
A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with noiseless or noisy feedback. The coding strategy involves block-...
Ptacek and Newsham [14] showed how to evade signature detection at Intrusion Prevention Systems (IPS) using TCP and IP Fragmentation. These attacks are implemented in tools like F...
George Varghese, J. Andrew Fingerhut, Flavio Bonom...