5658 search results - page 41 / 1132 » An Efficient Counting Network |
SAC
2002
ACM
13 years 9 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
IPSN
2007
Springer
14 years 4 months ago
2007
Springer
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
SIGCOMM
2004
ACM
14 years 3 months ago
2004
ACM
Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to...
DCOSS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We consider the problem of multihop broadcast over adaptively duty-cycled wireless sensor networks (WSNs) where neighborhood nodes are not simultaneously awake. We presen...
ADMA
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. The issue of maintaining privacy in frequent itemset mining has attracted considerable attentions. In most of those works, only distorted data are available which may bri...