Prati
Matteo Ceccarello
Matteo Ceccarello
Potvrđena adresa e-pošte na unibz.it
Naslov
Citirano
Citirano
Godina
Clustering uncertain graphs
M Ceccarello, C Fantozzi, A Pietracaprina, G Pucci, F Vandin
Proceedings of the VLDB Endowment 11 (4), 472-484, 2017
402017
Improved MapReduce and Streaming Algorithms for k-Center Clustering (with Outliers)
M Ceccarello, A Pietracaprina, G Pucci
arXiv preprint arXiv:1802.09205, 2018
35*2018
Mapreduce and streaming algorithms for diversity maximization in metric spaces of bounded doubling dimension
M Ceccarello, A Pietracaprina, G Pucci, E Upfal
arXiv preprint arXiv:1605.05590, 2016
262016
Space and time efficient parallel graph decomposition, clustering, and diameter approximation
M Ceccarello, A Pietracaprina, G Pucci, E Upfal
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015
212015
Fast coreset-based diversity maximization under matroid constraints
M Ceccarello, A Pietracaprina, G Pucci
Proceedings of the Eleventh ACM International Conference on Web Search and …, 2018
152018
Automated generation of model classes for java pathfinder
M Ceccarello, O Tkachuk
ACM SIGSOFT Software Engineering Notes 39 (1), 1-5, 2014
152014
FRESH: Fréchet similarity with hashing
M Ceccarello, A Driemel, F Silvestri
Workshop on Algorithms and Data Structures, 254-268, 2019
132019
A practical parallel algorithm for diameter approximation of massive weighted graphs
M Ceccarello, A Pietracaprina, G Pucci, E Upfal
2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2016
112016
Experimental evaluation of multi-round matrix multiplication on mapreduce
M Ceccarello, F Silvestri
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and …, 2014
82014
The role of local intrinsic dimensionality in benchmarking nearest neighbor search
M Aumüller, M Ceccarello
International Conference on Similarity Search and Applications, 113-127, 2019
72019
Tools to generate and check consistency of model classes for Java PathFinder
M Ceccarello, N Shafiei
ACM SIGSOFT Software Engineering Notes 37 (6), 1-5, 2012
52012
Distributed graph diameter approximation
M Ceccarello, A Pietracaprina, G Pucci, E Upfal
Algorithms 13 (9), 216, 2020
42020
A general coreset-based approach to diversity maximization under matroid constraints
M Ceccarello, A Pietracaprina, G Pucci
ACM Transactions on Knowledge Discovery from Data (TKDD) 14 (5), 1-27, 2020
42020
Benchmarking nearest neighbor search: influence of local intrinsic dimensionality and result diversity in real-world datasets
M Aumüller, M Ceccarello
Proceedings of the 1st Workshop on Evaluation and Experimental Design in …, 2019
32019
Running experiments with confidence and sanity
M Aumüller, M Ceccarello
International Conference on Similarity Search and Applications, 387-395, 2020
12020
Parallel graph decomposition and diameter approximation in o (diameter) time and linear space
M Ceccarello, A Pietracaprina, G Pucci, E Upfal
arXiv preprint arXiv:1407.3144, 2014
12014
Indexing Temporal Relations for Range-Duration Queries
M Ceccarello, A Dignös, J Gamper, C Khnaisser
arXiv preprint arXiv:2206.07428, 2022
2022
Efficient Computation of All-Window Length Correlations
A Charane, M Ceccarello, A Dignös, J Gamper
International Baltic Conference on Digital Business and Intelligent Systems …, 2022
2022
Implementing Distributed Approximate Similarity Joins using Locality Sensitive Hashing
M Aumüller, M Ceccarello
2022
The role of local dimensionality measures in benchmarking nearest neighbor search
M Aumüller, M Ceccarello
Information Systems 101, 101807, 2021
2021
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20