| Document Date: 2006-02-25 23:20:28
Open Document File Size: 1,21 MBShare Result on Facebook
City Nashville / / Company Intel Corporation / Computer-Communication Networks / / Country United States / / Currency pence / USD / / IndustryTerm wireless sensor motes / wireless sensors / poor solutions / sensor networks / data-driven algorithm / approximation algorithm / near-optimal solutions / polynomial time algorithm / greedy algorithm / pSPIEL algorithm / constant factor approximation algorithms / approximate solution / final solution / i-th chain / closed form solution / good approximation algorithms / wireless sensor network / wireless sensor networks / approximate algorithm / good approximate solutions / unconstrained greedy algorithm / search space / exhaustive search / cheaper solution / wireless communication / approximation algorithms / sensor network / / OperatingSystem TinyOS / / Organization National Science Foundation / Carnegie Mellon University / U.S. Securities and Exchange Commission / Cornell University / / Person Anupam Gupta / Ci / Sini / Jon Kleinberg / Gi / Anupam Gupta Jon Kleinberg Carnegie / Adrian Perrig / / Position Prime Minister / General / / Product CCR / / ProvinceOrState Tennessee / / Technology Greedy-Connect algorithm / radiation / proposed algorithm / artificial intelligence / polynomial time algorithm / approximation algorithm / following greedy algorithm / GPS / greedy algorithm / approximate k-MST algorithm / Quota-MST algorithm / approximation algorithms / pSPIEL algorithm / unconstrained greedy algorithm / Budget-MST algorithms / good approximation algorithms / polynomial-time / data-driven algorithm / constant factor approximation algorithms / Improved approximation algorithms / g∈C−Cj−1 end end Algorithm / / URL http /
SocialTag |
Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost Andreas Krause Carlos Guestrin