Sciweavers

4 search results - page 1 / 1
» Inapproximability of the Perimeter Defense Problem
Sort
View
CCCG
2009
13 years 6 months ago
Inapproximability of the Perimeter Defense Problem
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
Evangelos Kranakis, Danny Krizanc, Lata Narayanan,...
RAID
2007
Springer
13 years 11 months ago
Advanced Allergy Attacks: Does a Corpus Really Help?
Abstract. As research in automatic signature generators (ASGs) receives more attention, various attacks against these systems are being identified. One of these attacks is the “...
Simon P. Chung, Aloysius K. Mok
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
13 years 8 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
AAIM
2006
Springer
129views Algorithms» more  AAIM 2006»
13 years 8 months ago
Secure Overlay Network Design
Due to the increasing security threats on the Internet, new overlay network architectures have been proposed to secure privileged services. In these architectures, the application...
Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni