128 search results - page 2 / 26 » Sketching probabilistic data streams |
EDBT
2009
ACM
14 years 2 days ago
2009
ACM
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...
CPM
2007
Springer
14 years 1 months ago
2007
Springer
We address the problem of sketching the hamming distance of data streams. We present a new notion of sketching technique, Fixable sketches and we show that using such sketch not o...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
VLDB
2004
ACM
14 years 7 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...