2095 search results - page 253 / 419 » Improved pebbling bounds |
153
click to vote
RSS
2007
15 years 8 months ago
2007
— A simple approach for mobile robots to exploit multipath fading in order to improve received radio signal strength (RSS), is presented. The strategy is to sample the RSS at dis...
168
click to vote
SBBD
2007
15 years 8 months ago
2007
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...
210
click to vote
CCCG
2006
15 years 8 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
156
click to vote
CCCG
2006
15 years 8 months ago
2006
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
151
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...