557 search results - page 39 / 112 » On the set multi-cover problem in geometric settings |
143
click to vote
DM
2010
15 years 6 months ago
2010
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
135
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
142
click to vote
ICIP
2004
IEEE
16 years 7 months ago
2004
IEEE
We provide a new technique for the Euclidean upgrading of a projective calibration for a set of ten or more cameras with known skew angle and aspect ratio and arbitrary varying fo...
173
click to vote
TCS
2002
15 years 5 months ago
2002
We investigate the problem of producing symmetric tilings by programs in a uniform way. By this, we mean that the construction of a tiling should be parameterized by the geometric...
170
Voted
COMPGEOM
2009
ACM
16 years 18 days ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...