18 search results - page 2 / 4 » Space- and time-efficient deterministic algorithms for biase... |
STACS
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
PODS
2006
ACM
14 years 5 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
In a massive stream of sequential events such as stock feeds, sensor readings, or IP traffic measurements, tuples pertaining to recent events are typically more important than olde...
DKE
2008
13 years 5 months ago
2008
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...