33 search results - page 4 / 7 » A Simple Streaming Algorithm for Minimum Enclosing Balls |
DAM
2007
13 years 7 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
OL
2011
13 years 2 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
ESA
2003
Springer
14 years 20 days ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
COMPGEOM
2010
ACM
14 years 16 days ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...