257 search results - page 14 / 52 » An Approximate L1-Difference Algorithm for Massive Data Stre... |
CORR
2012
Springer
13 years 5 months ago
2012
Springer
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
166
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
PVLDB
2010
14 years 8 months ago
2010
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
DKE
2006
14 years 9 months ago
2006
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Compressed Counting (CC) was recently proposed for approximating the th frequency moments of data streams, for 0 < 2. Under the relaxed strict-Turnstile model, CC dramaticall...