557 search results - page 42 / 112 » On the set multi-cover problem in geometric settings |
120
Voted
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
124
click to vote
ECCV
2004
Springer
16 years 3 months ago
2004
Springer
Abstract. We consider the problem of estimating the shape and radiance of a scene from a calibrated set of images under the assumption that the scene is Lambertian and its radiance...
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
121
click to vote
CPM
2000
Springer
15 years 5 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
135
click to vote
ALGORITHMICA
2011
14 years 8 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...