33 search results - page 3 / 7 » A Simple Streaming Algorithm for Minimum Enclosing Balls |
SODA
2008
ACM
13 years 7 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
ESA
2008
Springer
13 years 8 months ago
2008
Springer
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
CCCG
2009
13 years 4 months ago
2009
We study the 1-center problem with outliers in highdimensional data streams. The problem definition is as follows: given a sequence of n points in d dimensions (with d arbitrarily...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
APPROX
2011
Springer
12 years 6 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...