| Document Date: 2009-09-24 16:12:25
Open Document File Size: 267,22 KBShare Result on Facebook
Facility Duke University / / IndustryTerm greedy set-cover algorithm / present efficient randomized algorithms / sensor networks / greedy algorithms / software implementation / approximation algorithm / exponential search procedure / sensor placement algorithms / greedy algorithm / polynomialtime log-approximation algorithms / hole detection algorithm / communication technologies / exponential search / simpler greedy algorithm / good approximation algorithms / wireless transmissions / computing / above algorithm / approximation algorithms / energy / / Organization National Institute of Health / National Science Foundation / Duke University / Durham / / Person Pankaj K. Agarwal / Esther Ezra / / Position Bouncy X−monotone Orthogonal General / general data sets / General / model the 2D spatial region / / ProvinceOrState North Carolina / / Technology above algorithm / communication technologies / greedy set-cover algorithm / approximation algorithm / simpler greedy algorithm / 2 Landmark Based Algorithm / greedy algorithm / Monte Carlo algorithm / approximation algorithms / hole detection algorithm / machine learning / greedy algorithms / sensor placement algorithms / good approximation algorithms / polynomialtime log-approximation algorithms / Monte Carlo algorithms / /
SocialTag |
Efficient Sensor Placement for Surveillance Problems⋆ Pankaj K. Agarwal, Esther Ezra, and Shashidhara Ganjugunte Dept. of Comp. Sci., Duke University, Durham, NCAbstract. We study the problem of covering a