257 search results - page 5 / 52 » An Approximate L1-Difference Algorithm for Massive Data Stre... |
EMNLP
2011
13 years 11 months ago
2011
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...
114
click to vote
SSDBM
2007
IEEE
15 years 6 months ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
103
Voted
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
120
Voted
KDD
2007
ACM
16 years 2 days ago
2007
ACM
In recent years, the proliferation of VOIP data has created a number of applications in which it is desirable to perform quick online classification and recognition of massive voi...
93
Voted
STACS
2007
Springer
15 years 5 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...