503 search results - page 20 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
ISSAC
2007
Springer
15 years 3 months ago
2007
Springer
Shirayanagi and Sweedler proved that a large class of algorithms over the reals can be modified slightly so that they also work correctly on fixed-precision floating-point numb...
ALGORITHMICA
2008
14 years 9 months ago
2008
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
110
click to vote
FAW
2010
Springer
14 years 9 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
95
Voted
TCS
2008
14 years 9 months ago
2008
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two no...