4843 search results - page 399 / 969 » The Shortcut Problem - Complexity and Approximation |
168
click to vote
IPSN
2009
Springer
15 years 11 months ago
2009
Springer
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
177
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—In multi-rate wireless LANs, throughput-based fair bandwidth allocation can lead to drastically reduced aggregate throughput. To balance aggregate throughput while serving users...
134
click to vote
IROS
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— Particle filters are a frequently used filtering technique in the robotics community. They have been successfully applied to problems such as localization, mapping, o...
154
Voted
ICDCS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
136
click to vote
ICTCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...