557 search results - page 37 / 112 » On the set multi-cover problem in geometric settings |
IWPEC
2004
Springer
14 years 2 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
SSD
1993
Springer
14 years 1 months ago
1993
Springer
: Spatial data types or algebras for database systems should (i) be fully general (which means, closed under set operations, hence e.g. a region value can be a set of polygons with...
JNS
2010
13 years 3 months ago
2010
Under certain conditions the problem of morphogenesis in development and the problem of morphology in block copolymers may be reduced to one geometric problem. In two dimensions t...
MOR
2010
13 years 7 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...