Sciweavers

9572 search results - page 67 / 1915
» Cover Algorithms and Their Combination
Sort
View
WEA
2005
Springer
100views Algorithms» more  WEA 2005»
14 years 3 months ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev
ICCAD
1999
IEEE
120views Hardware» more  ICCAD 1999»
14 years 2 months ago
Regularity extraction via clan-based structural circuit decomposition
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
Soha Hassoun, Carolyn McCreary
CCCG
2010
13 years 11 months ago
Multi-guard covers for polygonal regions
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
Zohreh Jabbari, William S. Evans, David G. Kirkpat...
INFOCOM
2006
IEEE
14 years 4 months ago
Design and Evaluation of a Fast and Robust Worm Detection Algorithm
— Fast spreading worms are a reality, as amply demonstrated by worms such as Slammer, which reached its peak propagation in a matter of minutes. With these kinds of fast spreadin...
Tian Bu, Aiyou Chen, Scott A. Vander Wiel, Thomas ...
CGF
2006
125views more  CGF 2006»
13 years 10 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels