Sciweavers

160 search results - page 22 / 32
» Approximate Computation of Object Distances by Locality-Sens...
Sort
View
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 5 months ago
Differentially Private Approximation Algorithms
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...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 10 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
SI3D
1999
ACM
14 years 6 days ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
GRAPHITE
2005
ACM
14 years 1 months ago
Generalized sweep templates for implicit modeling
A technique is presented for generating implicit sweep objects that support direct specification and manipulation of the surface with no topological limitations on the 2D sweep t...
Ryan Schmidt, Brian Wyvill
ICPR
2008
IEEE
14 years 9 months ago
A new approach to 3D shape recovery of local planar surface patches from shift-variant blurred images
A new approach is presented for 3D shape recovery of local planar surface patches from two shift/spacevariant defocused images. It is based on a recently proposed technique for in...
Murali Subbarao, Xue Tu, Youn-sik Kang