Sciweavers

226 search results - page 10 / 46
» Approximate Clustering on Distributed Data Streams
Sort
View
ISCI
2006
145views more  ISCI 2006»
13 years 7 months ago
Processing count queries over event streams at multiple time granularities
Management and analysis of streaming data has become crucial with its applications in web, sensor data, network traffic data, and stock market. Data streams consist of mostly nume...
Aykut Ünal, Yücel Saygin, Özgü...
DMSN
2004
ACM
14 years 1 months ago
Predictive filtering: a learning-based approach to data stream filtering
Recent years have witnessed an increasing interest in filtering of distributed data streams, such as those produced by networked sensors. The focus is to conserve bandwidth and se...
Vibhore Kumar, Brian F. Cooper, Shamkant B. Navath...
EDBT
2011
ACM
281views Database» more  EDBT 2011»
12 years 11 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
14 years 4 months ago
On Segment-Based Stream Modeling and Its Applications.
The primary constraint in the effective mining of data streams is the large volume of data which must be processed in real time. In many cases, it is desirable to store a summary...
Charu C. Aggarwal
HOTOS
2007
IEEE
13 years 11 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer