10 search results - page 2 / 2 » On approximate halfspace range counting and relative epsilon... |
ALGOSENSORS
2008
Springer
13 years 7 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
SIBGRAPI
2008
IEEE
13 years 11 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
ADC
2010
Springer
12 years 12 months ago
2010
Springer
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...
INFOVIS
1999
IEEE
13 years 9 months ago
1999
IEEE
Dynamic Queries offer continuous feedback during range queries, and have been shown to be effective and satisfying. Recent work has extended them to datasets of 100,000 objects an...
SENSYS
2004
ACM
13 years 10 months ago
2004
ACM
Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), makin...