Matteo Ceccarello

According to our database, Matteo Ceccarello authored at least 27 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Scaling Expected Force: Efficient Identification of Key Nodes in Network-Based Epidemic Models.

Paolo Sylos Labini, Andrej Jurco, Matteo Ceccarello, Stefano Guarino, Enrico Mastrostefano, Flavio Vella

Proceedings of the 32nd Euromicro International Conference on Parallel, 2024

Shapelets Evaluation using Silhouettes for Time Series Classification.

Adam Charane, Matteo Ceccarello, Johann Gamper

Proceedings of the 26th International Workshop on Design, 2024

2023

Scalable and space-efficient Robust Matroid Center algorithms.

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Federico Soldà

J. Big Data, December, 2023

Recent Approaches and Trends in Approximate Nearest Neighbor Search, with Remarks on Benchmarking.

Martin Aumüller, Matteo Ceccarello

IEEE Data Eng. Bull., 2023

Indexing Temporal Relations for Range-Duration Queries.

Matteo Ceccarello, Anton Dignös, Johann Gamper, Christina Khnaisser

Proceedings of the 35th International Conference on Scientific and Statistical Database Management, 2023

Solving k-Closest Pairs in High-Dimensional Data.

Martin Aumüller, Matteo Ceccarello

Proceedings of the Similarity Search and Applications - 16th International Conference, 2023

2022

Fast and Scalable Mining of Time Series Motifs with Probabilistic Guarantees.

Matteo Ceccarello, Johann Gamper

Proc. VLDB Endow., 2022

Implementing Distributed Similarity Joins using Locality Sensitive Hashing.

Martin Aumüller, Matteo Ceccarello

Proceedings of the 25th International Conference on Extending Database Technology, 2022

Efficient Computation of All-Window Length Correlations.

Adam Charane, Matteo Ceccarello, Anton Dignös, Johann Gamper

Proceedings of the Digital Business and Intelligent Systems, 2022

What's New in Temporal Databases?

Johann Gamper, Matteo Ceccarello, Anton Dignös

Proceedings of the Advances in Databases and Information Systems, 2022

2021

The role of local dimensionality measures in benchmarking nearest neighbor search.

Martin Aumüller, Matteo Ceccarello

Inf. Syst., 2021

2020

A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints.

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci

ACM Trans. Knowl. Discov. Data, 2020

Distributed Graph Diameter Approximation.

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal

Algorithms, 2020

Running Experiments with Confidence and Sanity.

Martin Aumüller, Matteo Ceccarello

Proceedings of the Similarity Search and Applications - 13th International Conference, 2020

2019

Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially.

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci

Proc. VLDB Endow., 2019

FRESH: Fréchet Similarity with Hashing.

Matteo Ceccarello, Anne Driemel, Francesco Silvestri

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

The Role of Local Intrinsic Dimensionality in Benchmarking Nearest Neighbor Search.

Martin Aumüller, Matteo Ceccarello

Proceedings of the Similarity Search and Applications - 12th International Conference, 2019

Benchmarking Nearest Neighbor Search: Influence of Local Intrinsic Dimensionality and Result Diversity in Real-World Datasets.

Martin Aumüller, Matteo Ceccarello

Proceedings of the 1st Workshop on Evaluation and Experimental Design in Data Mining and Machine Learning co-located with SIAM International Conference on Data Mining (SDM 2019), 2019

2018

Fast Coreset-based Diversity Maximization under Matroid Constraints.

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci

Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

2017

MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension.

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal

Proc. VLDB Endow., 2017

Clustering Uncertain Graphs.

Matteo Ceccarello, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin

Proc. VLDB Endow., 2017

2016

A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs.

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation.

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce.

Matteo Ceccarello, Francesco Silvestri

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Automated generation of model classes for Java PathFinder.

Matteo Ceccarello, Oksana Tkachuk

ACM SIGSOFT Softw. Eng. Notes, 2014

Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space.

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal

CoRR, 2014

2012

Tools to generate and check consistency of model classes for Java PathFinder.

Matteo Ceccarello, Nastaran Shafiei

ACM SIGSOFT Softw. Eng. Notes, 2012