Deterministic heavy hitters with sublinear query time
We study the classic problem of finding l_1 heavy hitters in the streaming model. In the general turnstile model, we give the first deterministic sublinear-time sketching algorithm which takes a linear sketch of length O(epsilon^{-2} log n * log^*(epsilon^{-1})), which is only a factor of log^*(epsi...
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/89241 http://hdl.handle.net/10220/46207 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|