1100 search results - page 95 / 220 » Approximate distance oracles |
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
156
click to vote
INFOCOM
2012
IEEE
13 years 16 days ago
2012
IEEE
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
153
click to vote
SODA
2012
ACM
13 years 16 days ago
2012
ACM
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...
105
click to vote
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
106
click to vote
SIBGRAPI
2008
IEEE
15 years 4 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...