15 search results - page 1 / 3 » Smaller core-sets for balls |
CRYPTO
2011
Springer
12 years 4 months ago
2011
Springer
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
SIAMJO
2008
13 years 4 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...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
ECCC
2011
12 years 12 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...