Sciweavers

60 search results - page 9 / 12
» Adaptive-Size Reservoir Sampling over Data Streams
Sort
View
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 9 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
VLDB
2004
ACM
134views Database» more  VLDB 2004»
14 years 1 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
14 years 7 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
DMSN
2007
ACM
13 years 11 months ago
Declarative temporal data models for sensor-driven query processing
Many sensor network applications monitor continuous phenomena by sampling, and fit time-varying models that capture the phenomena's behaviors. We introduce Pulse, a framework...
Yanif Ahmad, Ugur Çetintemel
GISCIENCE
2010
Springer
231views GIS» more  GISCIENCE 2010»
13 years 8 months ago
Efficient Data Collection and Event Boundary Detection in Wireless Sensor Networks Using Tiny Models
Using wireless geosensor networks (WGSN), sensor nodes often monitor a phenomenon that is both continuous in time and space. However, sensor nodes take discrete samples, and an ana...
Kraig King, Silvia Nittel