625 search results - page 107 / 125 » Approximating Travel Times Using Opportunistic Networking |
129
Voted
AAAI
2007
15 years 4 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
118
click to vote
ICASSP
2008
IEEE
15 years 8 months ago
2008
IEEE
We deal with consensus-based online estimation and tracking of (non-) stationary signals using ad hoc wireless sensor networks (WSNs). A distributed (D-) least-mean square (LMS) l...
116
click to vote
CCS
2004
ACM
15 years 7 months ago
2004
ACM
As network security is a growing concern, system administrators lock down their networks by closing inbound ports and only allowing outbound communication over selected protocols ...
137
Voted
CIKM
2010
Springer
15 years 14 days ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
122
click to vote
CISS
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...