1486 search results - page 59 / 298 » Algorithms for two-box covering |
106
Voted
ICCAD
1999
IEEE
15 years 5 months ago
1999
IEEE
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...
93
Voted
CCCG
2010
15 years 2 months ago
2010
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...
195
Voted
VSTTE
2012
Springer
13 years 8 months ago
2012
Springer
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
114
click to vote
CGF
2006
15 years 26 days ago
2006
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...
116
Voted
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...