1082 search results - page 102 / 217 » Approximation Algorithms for Spreading Points |
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
GRAPHITE
2005
ACM
14 years 2 months ago
2005
ACM
Surface fitting refers to the process of constructing a smooth representation for an object surface from a fairly large number of measured 3D data points. This paper presents an ...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— The inherent spread spectrum nature in ultrawideband (UWB) communications can support simultaneous transmissions. Two nearby transmissions do not collide, but rather ge...
FOGA
2011
13 years 15 days ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
SODA
2010
ACM
13 years 6 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...