24 citations · 30 across the 17 of their papers we have counts for
5 papers · 1 filter
A Parallel and Distributed Rust Library for Core Decomposition on Large Graphs
Davide Rucci, Sebastian Parfeniuc, Matteo Mordacchini +3
In this paper, we investigate the parallelization of -core decomposition, a method used in graph analysis to identify cohesive substructures and assess node centrality. Although…
Exact Nearest-Neighbor Search on Energy-Efficient FPGA Devices
Patrizio Dazzi, William Guglielmo, Franco Maria Nardini +2
This paper investigates the usage of FPGA devices for energy-efficient exact kNN search in high-dimension latent spaces. This work intercepts a relevant trend that tries to support…
A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
Matteo Mordacchini, Emanuele Carlini, Patrizio Dazzi
We address the problem of computing a Minimum Weighted Vertex Cover (MWVC) in a decentralized network. MWVC, a classical NP-hard problem, is foundational in applications such as ne…
Decentralized and Self-adaptive Core Maintenance on Temporal Graphs
Davide Rucci, Emanuele Carlini, Patrizio Dazzi +2
Key graph-based problems play a central role in understanding network topology and uncovering patterns of similarity in homogeneous and temporal data. Such patterns can be revealed…
WebAssembly and Unikernels: A Comparative Study for Serverless at the Edge
Valerio Besozzi, Enrico Fiasco, Marco Danelutto +1
Serverless computing at the edge requires lightweight execution environments to minimize cold start latency, especially in Urgent Edge Computing (UEC). This paper compares WebAssem…