Sciweavers

179 search results - page 22 / 36
» On Approximating the Average Distance Between Points
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
14 years 9 months ago
Differentially Private Combinatorial Optimization
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...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
NIPS
2007
15 years 1 months ago
Convex Clustering with Exemplar-Based Models
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...
Danial Lashkari, Polina Golland
TMC
2010
224views more  TMC 2010»
14 years 10 months ago
Multihop Range-Free Localization in Anisotropic Wireless Sensor Networks: A Pattern-Driven Scheme
—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...
Qingjun Xiao, Bin Xiao, Jiannong Cao, Jianping Wan...
COMGEO
2008
ACM
14 years 11 months ago
Optimal location of transportation devices
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 ...
Jean Cardinal, Sébastien Collette, Ferran H...
HLK
2003
IEEE
15 years 5 months ago
Generic Deformable Implicit Mesh Models for Automated Reconstruction
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...
Slobodan Ilic, Pascal Fua