Matteo Ceccarello

Orcid: 0000-0003-2783-0218

Affiliations:
  • IT University of Copenhagen, Denmark
  • University of Padua, Italy (former)


According to our database1, Matteo Ceccarello authored at least 29 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast and Accurate Fair k-Center Clustering in Doubling Metrics.
Proceedings of the ACM on Web Conference 2024, 2024

Scaling Expected Force: Efficient Identification of Key Nodes in Network-Based Epidemic Models.
Proceedings of the 32nd Euromicro International Conference on Parallel, 2024

Shapelets Evaluation using Silhouettes for Time Series Classification.
Proceedings of the 26th International Workshop on Design, 2024

Comparison of Measures for Characterizing the Difficulty of Time Series Classification.
Proceedings of the Big Data Analytics and Knowledge Discovery, 2024

2023
Scalable and space-efficient Robust Matroid Center algorithms.
J. Big Data, December, 2023

Recent Approaches and Trends in Approximate Nearest Neighbor Search, with Remarks on Benchmarking.
IEEE Data Eng. Bull., 2023

Indexing Temporal Relations for Range-Duration Queries.
Proceedings of the 35th International Conference on Scientific and Statistical Database Management, 2023

Solving k-Closest Pairs in High-Dimensional Data.
Proceedings of the Similarity Search and Applications - 16th International Conference, 2023

2022
Fast and Scalable Mining of Time Series Motifs with Probabilistic Guarantees.
Proc. VLDB Endow., 2022

Implementing Distributed Similarity Joins using Locality Sensitive Hashing.
Proceedings of the 25th International Conference on Extending Database Technology, 2022

Efficient Computation of All-Window Length Correlations.
Proceedings of the Digital Business and Intelligent Systems, 2022

What's New in Temporal Databases?
Proceedings of the Advances in Databases and Information Systems, 2022

2021
The role of local dimensionality measures in benchmarking nearest neighbor search.
Inf. Syst., 2021

2020
A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints.
ACM Trans. Knowl. Discov. Data, 2020

Distributed Graph Diameter Approximation.
Algorithms, 2020

Running Experiments with Confidence and Sanity.
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.
Proc. VLDB Endow., 2019

FRESH: Fréchet Similarity with Hashing.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

The Role of Local Intrinsic Dimensionality in Benchmarking Nearest Neighbor Search.
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.
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.
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.
Proc. VLDB Endow., 2017

Clustering Uncertain Graphs.
Proc. VLDB Endow., 2017

2016
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Automated generation of model classes for Java PathFinder.
ACM SIGSOFT Softw. Eng. Notes, 2014

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

2012
Tools to generate and check consistency of model classes for Java PathFinder.
ACM SIGSOFT Softw. Eng. Notes, 2012


  Loading...