137 search results - page 25 / 28 » Maintaining the Approximate Width of a Set of Points in the ... |
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
We address the sensor selection problem which arises in tracking and localization applications. In sensor selection, the goal is to select a small number of sensors whose measureme...
SIAMJO
2010
13 years 2 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
ESA
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...