3 search results - page 1 / 1 » Approximate Scalable Bounded Space Sketch for Large Data NLP |
EMNLP
2011
12 years 4 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...
EDBT
2004
ACM
14 years 4 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...