503 search results - page 11 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
SAC
2003
ACM
15 years 2 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
113
click to vote
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
AIPS
2003
14 years 11 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
SAC
2002
ACM
14 years 9 months ago
2002
ACM
Estimating multivariate location and scatter with both affine equivariance and positive breakdown has always been difficult. A well-known estimator which satisfies both properties...
87
Voted
DAGSTUHL
2003
14 years 11 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...