503 search results - page 6 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
120
click to vote
OL
2011
14 years 4 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...
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n threedimensional points. We give two mathematical properties of these parallelepip...
78
Voted
IGARSS
2010
14 years 7 months ago
2010
Spectral unmixing is an important task for remotely sensed hyperspectral data exploitation. Linear spectral unmixing relies on two main steps: 1) identification of pure spectral c...