Finding Top-k Most Frequent Items in Distributed Streams in the Time-Sliding Window Model

Emmanuelle Anceaume, Yann Busnel, Vasile Cazacu. Finding Top-k Most Frequent Items in Distributed Streams in the Time-Sliding Window Model. In 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops, DSN Workshops 2018, Luxembourg, June 25-28, 2018. pages 61-62, IEEE Computer Society, 2018. [doi]

@inproceedings{AnceaumeBC18-0,
  title = {Finding Top-k Most Frequent Items in Distributed Streams in the Time-Sliding Window Model},
  author = {Emmanuelle Anceaume and Yann Busnel and Vasile Cazacu},
  year = {2018},
  doi = {10.1109/DSN-W.2018.00030},
  url = {http://doi.ieeecomputersociety.org/10.1109/DSN-W.2018.00030},
  researchr = {https://researchr.org/publication/AnceaumeBC18-0},
  cites = {0},
  citedby = {0},
  pages = {61-62},
  booktitle = {48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops, DSN Workshops 2018, Luxembourg, June 25-28, 2018},
  publisher = {IEEE Computer Society},
  isbn = {978-1-5386-6553-4},
}