1082 search results - page 109 / 217 » Approximation Algorithms for Spreading Points |
115
Voted
DCOSS
2007
Springer
15 years 7 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
126
Voted
IJCV
2007
15 years 3 months ago
2007
The parameter space for the ellipses in a two dimensional image is a five dimensional manifold, where each point of the manifold corresponds to an ellipse in the image. The parame...
88
Voted
CCCG
2010
15 years 5 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
135
Voted
COLT
2003
Springer
15 years 8 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
137
Voted
IEEECIT
2009
IEEE
15 years 10 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...