We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
Amitabha Bagchi, Amitabh Chaudhary, David Eppstein...
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Nowadays, one of the main research issues of great interest is the efficient tracking of mobile objects that enables the effective answering of spatiotemporal queries. This line o...
Katerina Raptopoulou, Michael Vassilakopoulos, Yan...
There are numerous applications such as air traffic management, cellular phone location tracking, and vehicle protection systems where there is a critical need to reason about mo...
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such a...