Add to ORKGABSTRACT. We consider the problem of approximating the frequency of frequently occuring elements in a stream of length n using only a memory of size m n.
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency m...
Abstract—Dynamic bandwidth estimation serves as an important basis for performance optimization of r...
We consider the read/write streams model, an extension of the standard data stream model in which an...
We consider the problem of approximating the frequency of frequently occurring elements in a stream...
We present algorithms for computing frequency counts exceeding a user-specified threshold over data ...
International audienceWe investigate the problem of estimating on the fly the frequency at which ite...
AbstractWe present a 1-pass algorithm for estimating the most frequent items in a data stream using ...
In this paper we consider the problem of approximating frequency moments in the streaming model. Giv...
We consider general update streams, where, the stream is a sequence of updates of the form $(index, ...
We study the well-known frequent items problem in data streams from a competitive analysis point of ...
We study the problem of finding frequent itemsets in a continuous stream of transactions. The curren...
Maintaining frequency counts for data streams has attracted much interest among the research communi...
Recently, an extension of the standard data stream model has been introduced in which an algorithm c...
We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data...
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency m...
Abstract—Dynamic bandwidth estimation serves as an important basis for performance optimization of r...
We consider the read/write streams model, an extension of the standard data stream model in which an...
We consider the problem of approximating the frequency of frequently occurring elements in a stream...
We present algorithms for computing frequency counts exceeding a user-specified threshold over data ...
International audienceWe investigate the problem of estimating on the fly the frequency at which ite...
AbstractWe present a 1-pass algorithm for estimating the most frequent items in a data stream using ...
In this paper we consider the problem of approximating frequency moments in the streaming model. Giv...
We consider general update streams, where, the stream is a sequence of updates of the form $(index, ...
We study the well-known frequent items problem in data streams from a competitive analysis point of ...
We study the problem of finding frequent itemsets in a continuous stream of transactions. The curren...
Maintaining frequency counts for data streams has attracted much interest among the research communi...
Recently, an extension of the standard data stream model has been introduced in which an algorithm c...
We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data...
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency m...
Abstract—Dynamic bandwidth estimation serves as an important basis for performance optimization of r...
We consider the read/write streams model, an extension of the standard data stream model in which an...