2705 search results - page 65 / 541 » Splitting the sensor node |
165
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
224
click to vote
PERCOM
2010
ACM
14 years 11 months ago
2010
ACM
In this paper, we propose an algorithm to estimate 2D shapes and positions of obstacles such as buildings using GPS and wireless communication history of mobile nodes. Our algorith...
253
click to vote
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
148
click to vote
SASN
2003
ACM
15 years 9 months ago
2003
ACM
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
196
click to vote
AISS
2010
15 years 1 months ago
2010
Aiming at the task allocation in multi-target tracking of wireless sensor networks, the discrete particle swarm optimization based on nearest-neighbor is presented to reduce the c...