82 search results - page 1 / 17 » Optimal core-sets for balls |
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
SIAMJO
2008
14 years 9 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
PCM
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we propose a scheme for ball detection and tracking in broadcast soccer video. There are two alternate procedures in the scheme: ball detection and ball tracking. In ...
65
Voted
POPL
1992
ACM
15 years 1 months ago
1992
ACM
COMPGEOM
2004
ACM
15 years 2 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...