28 citations · 50 across the 9 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016
Fast and Accurate Mining of Correlated Heavy Hitters
Italo Epicoco, Massimo Cafaro, Marco Pulimeno
The problem of mining Correlated Heavy Hitters (CHH) from a two-dimensional data stream has been introduced recently, and a deterministic algorithm based on the use of the Misra--G…
cs.DC2016
Parallel Space Saving on Multi and Many-Core Processors
Massimo Cafaro, Marco Pulimeno, Italo Epicoco +1
Given an array of elements and a value , a frequent item or -majority element is an element occurring in more than times.…
cs.DS2016★ 22 cited
Mining frequent items in the time fading model
Massimo Cafaro, Marco Pulimeno, Italo Epicoco +1
We present FDCMSS, a new sketch-based algorithm for mining frequent items in data streams. The algorithm cleverly combines key ideas borrowed from forward decay, the Count-Min and…