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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Emmanuelle Anceaume' in GoogleThis author has not been identified. Look up 'Yann Busnel' in GoogleThis author has not been identified. Look up 'Vasile Cazacu' in Google

runs on WebDSL