5448 search results - page 456 / 1090 » Breakpoints and Time in Distributed Computations |
225
Voted
TC
2011
15 years 1 months ago
2011
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
567
click to vote
ICA
2012
Springer
14 years 2 months ago
2012
Springer
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
756
Voted
Presentation
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
159
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
195
click to vote
MOBICOM
2012
ACM
13 years 9 months ago
2012
ACM
Access to relative location of nearby vehicles on the local roads or on the freeways is useful for providing critical alerts to the drivers, thereby enhancing their driving experi...