In this work, we describe a range of prototy** boards such as Arduino, Raspberry Pi, and
BeagleBone Black, and we show how these devices are being used in our ECE curriculum …

De novo whole genome assembly reconstructs genomic sequences from short, overlap**,
and potentially erroneous DNA segments and is one of the most important computations in …

Estimating frequencies of items over data streams is a common building block in streaming
data measurement and analysis. Misra and Gries introduced their seminal algorithm for the …

The increasing number of cores and the rich instruction sets of modern hardware are
opening up new opportunities for optimizing many traditional data mining tasks. In this paper …

We present a message-passing based parallel version of the Space Saving algorithm
designed to solve the k–majority problem. The algorithm determines in parallel frequent …

Given an array of n elements and a value 2≤ k≤ n, a frequent item or k‐majority element is
an element occurring in more than n/k times. The k‐majority problem requires finding all of …

We deal with the problem of detecting frequent items in a stream under the constraint that
items are weighted, and recent items must be weighted more than older ones. This kind of …

Reliably tracking large network flows in order to determine so-called elephant flows, also
known as heavy hitters or frequent items, is a common data mining task. Indeed, this kind of …

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 …

We present four CUDA based parallel implementations of the Space-Saving algorithm for
determining frequent items on a GPU. The first variant exploits the open-source CUB library …