1082 search results - page 155 / 217 » Approximation Algorithms for Spreading Points |
WADS
2005
Springer
14 years 2 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
CMPB
2010
13 years 9 months ago
2010
We demonstrate the use of highly parallel graphics processing units (GPUs) to accelerate the Superposition/Convolution (S/C) algorithm to interactive rates while reducing the numbe...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
— Self-monitoring the sensor statuses such as liveness, node density and residue energy is critical for maintaining the normal operation of the sensor network. When building the ...
SIGIR
1998
ACM
14 years 1 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....