Sciweavers

2489 search results - page 449 / 498
» On the Subgroup Distance Problem
Sort
View
ALGOSENSORS
2007
Springer
15 years 6 months ago
Counting Targets with Mobile Sensors in an Unknown Environment
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
Beat Gfeller, Matús Mihalák, Subhash...
IPSN
2007
Springer
15 years 6 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao
INFOCOM
2006
IEEE
15 years 5 months ago
Broadcasting in Sensor Networks: The Role of Local Information
Abstract— Flooding based strategies are conventionally employed to perform querying and broadcasting in sensor networks. These schemes have low hop-delays of Θ( 1 M(n) ) to reac...
Sundar Subramanian, Sanjay Shakkottai, Ari Arapost...
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 5 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
PODC
2003
ACM
15 years 5 months ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...