179 search results - page 22 / 36 » On Approximating the Average Distance Between Points |
164
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
116
click to vote
NIPS
2007
15 years 5 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
157
click to vote
TMC
2010
15 years 2 months ago
2010
—This paper focuses on multihop range-free localization in anisotropic wireless sensor networks. In anisotropic networks, geometric distance between a pair of sensor nodes is not...
160
click to vote
COMGEO
2008
ACM
15 years 4 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
142
click to vote
HLK
2003
IEEE
15 years 9 months ago
2003
IEEE
Deformable 3–D models can be represented either as explicit or implicit surfaces. Explicit surfaces, such as triangulations or wire-frame models, are widely accepted in the Comp...