Sciweavers

494 search results - page 72 / 99
» Approximate continuous querying over distributed streams
Sort
View
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
14 years 4 months ago
Sketching Sampled Data Streams
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
Florin Rusu, Alin Dobra
SIGIR
2009
ACM
14 years 4 months ago
Effective query expansion for federated search
While query expansion techniques have been shown to improve retrieval performance in a centralized setting, they have not been well studied in a federated setting. In this paper, ...
Milad Shokouhi, Leif Azzopardi, Paul Thomas
PODS
2009
ACM
110views Database» more  PODS 2009»
14 years 10 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
IDA
2002
Springer
13 years 9 months ago
Online classification of nonstationary data streams
Most classification methods are based on the assumption that the data conforms to a stationary distribution. However, the real-world data is usually collected over certain periods...
Mark Last
ICDE
2009
IEEE
158views Database» more  ICDE 2009»
14 years 11 months ago
KSpot: Effectively Monitoring the K Most Important Events in a Wireless Sensor Network
This demo presents a graphical user interface and ranking system, coined KSpot, for effectively monitoring the K highest-ranked answers to a query Q in a Wireless Sensor Network. K...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, M...