Francesco Silvestri

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 39

Top Topics

Dimensionality Reduction

High Dimensions

Similarity Join

Matrix Multiplication

Top Venues

Publications

Lorenzo Padoan, Margherita Cesetti, Luca Brunello, Marco Antonelli, Bruno Zamengo, Francesco Silvestri
Mobility ChatBot: supporting decision making in mobility data with chatbots. MDM (2024)
Fabrizio Ferrandi, Serena Curzel, Leandro Fiorin, Daniele Ielmini, Cristina Silvano, Francesco Conti, Alessio Burrello, Francesco Barchi, Luca Benini, Luciano Lavagno, Teodoro Urso, Enrico Calore, Sebastiano Fabio Schifano, Cristian Zambelli, Maurizio Palesi, Giuseppe Ascia, Enrico Russo, Nicola Petra, Davide De Caro, Gennaro Di Meo, Valeria Cardellini, Salvatore Filippone, Francesco Lo Presti, Francesco Silvestri, Paolo Palazzari, Stefania Perri
A Survey on Design Methodologies for Accelerating Deep Learning on Heterogeneous Architectures. CoRR (2023)
Shiyuan Deng, Francesco Silvestri, Yufei Tao
Enumerating Subgraphs of Constant Sizes in External Memory. ICDT (2023)
Paolo Sylos Labini, Massimo Bernaschi, Werner Nutt, Francesco Silvestri, Flavio Vella
Blocking Sparse Matrices to Leverage Dense-Specific Multiplication. IA3@SC (2022)
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? ACM Trans. Database Syst. 47 (1) (2022)
Paolo Pellizzoni, Francesco Silvestri
Dimensionality reduction on complex vector spaces for dynamic weighted Euclidean distance. CoRR (2022)
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Sampling near neighbors in search for fairness. Commun. ACM 65 (8) (2022)
Paolo Sylos Labini, Massimo Bernaschi, Francesco Silvestri, Flavio Vella
Blocking Techniques for Sparse Matrix Multiplication on Tensor Accelerators. CoRR (2022)
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? CoRR (2021)
Elia Costa, Francesco Silvestri
On the Bike Spreading Problem. ATMOS (2021)
Rezaul Chowdhury, Francesco Silvestri, Flavio Vella
Algorithm Design for Tensor Units. Euro-Par (2021)
Elia Costa, Francesco Silvestri
On the Bike Spreading Problem. CoRR (2021)
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Fair near neighbor search via sampling. SIGMOD Rec. 50 (1) (2021)
Martin Aumüller, Rasmus Pagh, Francesco Silvestri
Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. PODS (2020)
Thomas D. Ahle, Francesco Silvestri
Similarity Search with Tensor Core Units. CoRR (2020)
Thomas D. Ahle, Francesco Silvestri
Similarity Search with Tensor Core Units. SISAP (2020)
Rezaul Chowdhury, Francesco Silvestri, Flavio Vella
A Computational Model for Tensor Core Units. SPAA (2020)
Matteo Ceccarello, Anne Driemel, Francesco Silvestri
FRESH: Fréchet Similarity with Hashing. WADS (2019)
Martin Aumüller, Rasmus Pagh, Francesco Silvestri
Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. CoRR (2019)
Francesco Silvestri, Flavio Vella
A Computational Model for Tensor Core Units. CoRR (2019)
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
A Lower Bound Technique for Communication in BSP. ACM Trans. Parallel Comput. 4 (3) (2018)
Matteo Ceccarello, Anne Driemel, Francesco Silvestri
FRESH: Fréchet Similarity with Hashing. CoRR (2018)
Ha-Myung Park, Francesco Silvestri, Rasmus Pagh, Chin-Wan Chung, Sung-Hyon Myaeng, U Kang
Enumerating Trillion Subgraphs On Distributed Systems. ACM Trans. Knowl. Discov. Data 12 (6) (2018)
Samuel McCauley, Francesco Silvestri
Adaptive MapReduce Similarity Joins. CoRR (2018)
Samuel McCauley, Francesco Silvestri
Adaptive MapReduce Similarity Joins. BeyondMR@SIGMOD (2018)
Martin Aumüller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri
Distance-Sensitive Hashing. PODS (2018)
Mayank Goswami, Rasmus Pagh, Francesco Silvestri, Johan Sivertsen
Distance Sensitive Bloom Filters Without False Negatives. SODA (2017)
Anne Driemel, Francesco Silvestri
Locality-sensitive hashing of curves. CoRR (2017)
Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri
A Time-Space Trade-Off for Triangulations of Points in the Plane. COCOON (2017)
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
A Lower Bound Technique for Communication in BSP. CoRR (2017)
Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala
Approximate furthest neighbor with application to annulus query. Inf. Syst. 64 (2017)
Martin Aumüller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri
Distance-sensitive hashing. CoRR (2017)
Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri
Resilient Dynamic Programming. Algorithmica 77 (2) (2017)
Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel
I/O-Efficient Similarity Join. Algorithmica 78 (4) (2017)
Anne Driemel, Francesco Silvestri
Locality-Sensitive Hashing of Curves. SoCG (2017)
Mayank Goswami, Rasmus Pagh, Francesco Silvestri, Johan Sivertsen
Distance Sensitive Bloom Filters Without False Negatives. CoRR (2016)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri
Network-Oblivious Algorithms. J. ACM 63 (1) (2016)
Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri
On the Complexity of Inner Product Similarity Join. PODS (2016)
Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala
Approximate Furthest Neighbor with Application to Annulus Query. CoRR (2016)
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin
Space-efficient parallel algorithms for combinatorial search problems. J. Parallel Distributed Comput. 76 (2015)
Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel
I/O-Efficient Similarity Join. CoRR (2015)
Matteo Ceccarello, Francesco Silvestri
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. ALENEX (2015)
Lorenzo De Stefani, Francesco Silvestri
Exploiting non-constant safe memory in resilient algorithms and data structures. Theor. Comput. Sci. 583 (2015)
Thomas D. Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri
On the Complexity of Inner Product Similarity Join. CoRR (2015)
Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel
I/O-Efficient Similarity Join. ESA (2015)
Rasmus Pagh, Francesco Silvestri, Johan Sivertsen, Matthew Skala
Approximate Furthest Neighbor in High Dimensions. SISAP (2015)
Michele Scquizzato, Francesco Silvestri
Communication Lower Bounds for Distributed-Memory Computations. STACS (2014)
Francesco Silvestri
Subgraph Enumeration in Massive Graphs. CoRR (2014)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri
Network-Oblivious Algorithms. CoRR (2014)
Matteo Ceccarello, Francesco Silvestri
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. CoRR (2014)
Rasmus Pagh, Francesco Silvestri
The input/output complexity of triangle enumeration. PODS (2014)
Ha-Myung Park, Francesco Silvestri, U Kang, Rasmus Pagh
MapReduce Triangle Enumeration With Guarantees. CIKM (2014)
Rasmus Pagh, Francesco Silvestri
The Input/Output Complexity of Triangle Enumeration. CoRR (2013)
Lorenzo De Stefani, Francesco Silvestri
Exploiting non-constant safe memory in resilient algorithms and data structures CoRR (2013)
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin
Space-Efficient Parallel Algorithms for Combinatorial Search Problems. MFCS (2013)
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin
Space-Efficient Parallel Algorithms for Combinatorial Search Problems. CoRR (2013)
Michele Scquizzato, Francesco Silvestri
Communication Lower Bounds for Distributed-Memory Computations. CoRR (2013)
Rezaul Alam Chowdhury, Vijaya Ramachandran, Francesco Silvestri, Brandon Blakeley
Oblivious algorithms for multicores and networks of processors. J. Parallel Distributed Comput. 73 (7) (2013)
Paolo Rech, Laércio Lima Pilla, Francesco Silvestri, Philippe Olivier Alexandre Navaux, Luigi Carro
Neutron sensitivity and software hardening strategies for matrix multiplication and FFT on graphics processing units. FTXS (2013)
Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal
Space-round tradeoffs for MapReduce computations. ICS (2012)
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
A Lower Bound Technique for Communication on BSP with Application to the FFT. Euro-Par (2012)
Francesco Silvestri
Review of graph theory and interconnection networks, by Lih-Hsing Hsu and Cheng-Kuan Lin. SIGACT News 43 (4) (2012)
Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal
Space-Round Tradeoffs for MapReduce Computations CoRR (2011)
Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri
Dynamic programming in faulty memory hierarchies (cache-obliviously). FSTTCS (2011)
Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley, Vijaya Ramachandran
Oblivious algorithms for multicores and network of processors. IPDPS (2010)
Paolo Bertasi, Alberto Pettarin, Michele Scquizzato, Francesco Silvestri
A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments. TGC (2010)
Sara Nasso, Francesco Silvestri, Francesco Tisiot, Barbara Di Camillo, Andrea Pietracaprina, Gianna Maria Toffolo
An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree CoRR (2010)
Francesco Silvestri
On the limits of cache-oblivious rational permutations. Theor. Comput. Sci. 402 (2-3) (2008)
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri
Network-Oblivious Algorithms. IPDPS (2007)
Francesco Silvestri
On the Limits of Cache-Oblivious Matrix Transposition. TGC (2006)
Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri
Cache-oblivious simulation of parallel programs. IPDPS (2006)