Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
Boris Aronov, Alon Efrat, Dan Halperin, Micha Shar...
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
for Dynamic Abstract Regions Joxan Jaffar Roland H.C. Yap School of Computing National University of Singapore 3 Science Drive 2, 117543, Singapore {joxan, ryap}@comp.nus.edu.sg Ke...
— P2P file-sharing systems have indexes, which users search to find locations of desired titles. In the index poisoning attack, the attacker inserts massive numbers of bogus re...
The Web Documentation Project at the University of Delaware (UD) organizes the computing help information available to the University community. The project’s goal is to provide...