activity
20192023
most citedA reduced-precision streaming SpMV architecture for Personalized PageRank on FPGA

2 citations · 3 across the 6 of their papers we have counts for

collaborators

7 papers

cs.LG2023

Geometric Algorithms for -NN Poisoning

Diego Ihara Centurion, Karine Chubarian, Bohan Fan +4

We propose a label poisoning attack on geometric data sets against -nearest neighbor classification. We provide an algorithm that can compute an -additive approxi…

cs.AR2023

SpChar: Characterizing the Sparse Puzzle via Decision Trees

Francesco Sgherzi, Marco Siracusa, Ivan Fernandez +2

Sparse matrix computation is crucial in various modern applications, including large-scale graph analytics, deep learning, and recommender systems. The performance of sparse kernel…

cs.AR2022★ 1 cited

A Mixed Precision, Multi-GPU Design for Large-scale Top-K Sparse Eigenproblems

Francesco Sgherzi, Alberto Parravicini, Marco Domenico Santambrogio

Graph analytics techniques based on spectral methods process extremely large sparse matrices with millions or even billions of non-zero values. Behind these algorithms lies the Top…

cs.AR2021

Solving Large Top-K Graph Eigenproblems with a Memory and Compute-optimized FPGA Design

Francesco Sgherzi, Alberto Parravicini, Marco Siracusa +1

Large-scale eigenvalue computations on sparse matrices are a key component of graph analytics techniques based on spectral methods. In such applications, an exhaustive computation…

cs.DC2020★ 2 cited

A reduced-precision streaming SpMV architecture for Personalized PageRank on FPGA

Alberto Parravicini, Francesco Sgherzi, Marco D. Santambrogio

Sparse matrix-vector multiplication is often employed in many data-analytic workloads in which low latency and high throughput are more valuable than exact numerical convergence. F…

cs.DS2020

Learning Lines with Ordinal Constraints

Bohan Fan, Diego Ihara Centurion, Neshat Mohammadi +3

We study the problem of finding a mapping from a set of points into the real line, under ordinal triple constraints. An ordinal constraint for a triple of points asse…

cs.LG2019

Robust Mahalanobis Metric Learning via Geometric Approximation Algorithms

Diego Ihara, Neshat Mohammadi, Francesco Sgherzi +1

Learning Mahalanobis metric spaces is an important problem that has found numerous applications. Several algorithms have been designed for this problem, including Information Theor…