Sciweavers

55 search results - page 11 / 11
» Model-based approximate querying in sensor networks
Sort
View
JCST
2007
151views more  JCST 2007»
13 years 6 months ago
Indexing Future Trajectories of Moving Objects in a Constrained Network
Abstract Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic managemen...
Ji-Dong Chen, Xiao-Feng Meng
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 7 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
WIS
2004
13 years 7 months ago
A Wireless Data Stream Mining Model
The sensor networks, web click stream and astronomical applications generate a continuous flow of data streams. Most likely data streams are generated in a wireless environment. Th...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 7 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
PODS
2008
ACM
109views Database» more  PODS 2008»
14 years 6 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura