activity
20172022
most citedLocality-sensitive hashing of curves

35 citations · 36 across the 3 of their papers we have counts for

collaborators

11 papers

cs.DC20221 cited

Blocking Techniques for Sparse Matrix Multiplication on Tensor Accelerators

Paolo Sylos Labini, Massimo Bernaschi, Francesco Silvestri +1

Tensor accelerators have gained popularity because they provide a cheap and efficient solution for speeding up computational-expensive tasks in Deep Learning and, more recently, in…

cs.DS2021

On the Bike Spreading Problem

Elia Costa, Francesco Silvestri

A free-floating bike-sharing system (FFBSS) is a dockless rental system where an individual can borrow a bike and returns it anywhere, within the service area. To improve the renta…

cs.DS2021

Sampling a Near Neighbor in High Dimensions -- Who is the Fairest of Them All?

Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi +2

Similarity search is a fundamental algorithmic primitive, widely used in many computer science disciplines. Given a set of points and a radius parameter , the -near nei…

cs.DS2020

Similarity Search with Tensor Core Units

Thomas D. Ahle, Francesco Silvestri

Tensor Core Units (TCUs) are hardware accelerators developed for deep neural networks, which efficiently support the multiplication of two dense matrices,…

cs.DS2019

A Computational Model for Tensor Core Units

Rezaul Chowdhury, Francesco Silvestri, Flavio Vella

To respond to the need of efficient training and inference of deep neural networks, a plethora of domain-specific hardware architectures have been introduced, such as Google Tensor…

cs.DS2019

Fair Near Neighbor Search: Independent Range Sampling in High Dimensions

Martin Aumüller, Rasmus Pagh, Francesco Silvestri

Similarity search is a fundamental algorithmic primitive, widely used in many computer science disciplines. There are several variants of the similarity search problem, and one of…