activity
20162025
most citedEnabling Dynamic and Intelligent Workflows for HPC, Data Analytics, and AI Convergence

58 citations · 119 across the 5 of their papers we have counts for

collaborators

6 papers

cs.CE2025

Application of association rule mining to assess forest species distribution in Italy considering abiotic and biotic factors

Valeria Aloisi, Sergio Noce, Italo Epicoco +7

Biodiversity monitoring represents a pressing global priority, and assessing forest community composition plays a crucial role due to its influence on ecosystem functions. The spat…

physics.ao-ph2023★ 18 cited

An Ensemble Machine Learning Approach for Tropical Cyclone Detection Using ERA5 Reanalysis Data

Gabriele Accarino, Davide Donno, Francesco Immorlano +2

Tropical Cyclones (TCs) are counted among the most destructive phenomena that can be found in nature. Every year, globally an average of 90 TCs occur over tropical waters, and glob…

cs.DC2022★ 58 cited

Enabling Dynamic and Intelligent Workflows for HPC, Data Analytics, and AI Convergence

Jorge Ejarque, Rosa M. Badia, Loïc Albertin +34

The evolution of High-Performance Computing (HPC) platforms enables the design and execution of progressively larger and more complex workflow applications in these systems. The co…

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.SE2016★ 21 cited

INDIGO-Datacloud: foundations and architectural description of a Platform as a Service oriented to scientific computing

D. Salomoni, I. Campos, L. Gaido +32

In this paper we describe the architecture of a Platform as a Service (PaaS) oriented to computing and data analysis. In order to clarify the choices we made, we explain the featur…

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…