1486 search results - page 60 / 298 » Algorithms for two-box covering |
107
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
187
Voted
GIS
2006
ACM
16 years 1 months ago
2006
ACM
We present a novel method for the automatic generalization of land cover maps. A land cover map is composed of areas that collectively form a tessellation of the plane and each ar...
128
click to vote
ICCAD
1997
IEEE
15 years 5 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
102
click to vote
DAC
2009
ACM
15 years 7 months ago
2009
ACM
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...
118
click to vote
FCT
2009
Springer
15 years 7 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...