default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatteo Ceccarello
Person information
- affiliation: IT University of Copenhagen, Denmark
- affiliation (former): University of Padua, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j11]Martin Aumüller, Matteo Ceccarello:
Recent Approaches and Trends in Approximate Nearest Neighbor Search, with Remarks on Benchmarking. IEEE Data Eng. Bull. 46(3): 89-105 (2023)- [j10]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci
, Federico Soldà:
Scalable and space-efficient Robust Matroid Center algorithms. J. Big Data 10(1): 49 (2023) - 2022
- [j9]Matteo Ceccarello, Johann Gamper:
Fast and Scalable Mining of Time Series Motifs with Probabilistic Guarantees. Proc. VLDB Endow. 15(13): 3841-3853 (2022) - 2021
- [j8]Martin Aumüller, Matteo Ceccarello:
The role of local dimensionality measures in benchmarking nearest neighbor search. Inf. Syst. 101: 101807 (2021) - 2020
- [j7]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Distributed Graph Diameter Approximation. Algorithms 13(9): 216 (2020) - [j6]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints. ACM Trans. Knowl. Discov. Data 14(5): 60:1-60:27 (2020) - 2019
- [j5]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially. Proc. VLDB Endow. 12(7): 766-778 (2019) - 2017
- [j4]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. Proc. VLDB Endow. 10(5): 469-480 (2017) - [j3]Matteo Ceccarello, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin:
Clustering Uncertain Graphs. Proc. VLDB Endow. 11(4): 472-484 (2017) - 2014
- [j2]Matteo Ceccarello, Oksana Tkachuk:
Automated generation of model classes for Java PathFinder. ACM SIGSOFT Softw. Eng. Notes 39(1): 1-5 (2014) - 2012
- [j1]Matteo Ceccarello, Nastaran Shafiei:
Tools to generate and check consistency of model classes for Java PathFinder. ACM SIGSOFT Softw. Eng. Notes 37(6): 1-5 (2012)
Conference and Workshop Papers
- 2024
- [c17]Adam Charane, Matteo Ceccarello, Johann Gamper:
Comparison of Measures for Characterizing the Difficulty of Time Series Classification. DaWaK 2024: 239-244 - [c16]Adam Charane, Matteo Ceccarello, Johann Gamper:
Shapelets Evaluation using Silhouettes for Time Series Classification. DOLAP 2024: 36-44 - [c15]Paolo Sylos Labini, Andrej Jurco, Matteo Ceccarello, Stefano Guarino, Enrico Mastrostefano, Flavio Vella:
Scaling Expected Force: Efficient Identification of Key Nodes in Network-Based Epidemic Models. PDP 2024: 98-107 - [c14]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
Fast and Accurate Fair k-Center Clustering in Doubling Metrics. WWW 2024: 756-767 - 2023
- [c13]Martin Aumüller, Matteo Ceccarello:
Solving k-Closest Pairs in High-Dimensional Data. SISAP 2023: 200-214 - [c12]Matteo Ceccarello, Anton Dignös, Johann Gamper, Christina Khnaisser:
Indexing Temporal Relations for Range-Duration Queries. SSDBM 2023: 3:1-3:12 - 2022
- [c11]Johann Gamper, Matteo Ceccarello, Anton Dignös:
What's New in Temporal Databases? ADBIS 2022: 45-58 - [c10]Adam Charane, Matteo Ceccarello, Anton Dignös, Johann Gamper:
Efficient Computation of All-Window Length Correlations. DB&IS 2022: 251-266 - [c9]Martin Aumüller, Matteo Ceccarello:
Implementing Distributed Similarity Joins using Locality Sensitive Hashing. EDBT 2022: 1:78-1:90 - 2020
- [c8]Martin Aumüller, Matteo Ceccarello:
Running Experiments with Confidence and Sanity. SISAP 2020: 387-395 - 2019
- [c7]Martin Aumüller, Matteo Ceccarello:
Benchmarking Nearest Neighbor Search: Influence of Local Intrinsic Dimensionality and Result Diversity in Real-World Datasets. EDML@SDM 2019: 14-23 - [c6]Martin Aumüller, Matteo Ceccarello:
The Role of Local Intrinsic Dimensionality in Benchmarking Nearest Neighbor Search. SISAP 2019: 113-127 - [c5]Matteo Ceccarello, Anne Driemel, Francesco Silvestri:
FRESH: Fréchet Similarity with Hashing. WADS 2019: 254-268 - 2018
- [c4]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
Fast Coreset-based Diversity Maximization under Matroid Constraints. WSDM 2018: 81-89 - 2016
- [c3]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. IPDPS 2016: 12-21 - 2015
- [c2]Matteo Ceccarello, Francesco Silvestri:
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. ALENEX 2015: 119-132 - [c1]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. SPAA 2015: 182-191
Informal and Other Publications
- 2023
- [i11]Paolo Sylos Labini, Andrej Jurco, Matteo Ceccarello, Stefano Guarino, Enrico Mastrostefano, Flavio Vella:
Scaling Expected Force: Efficient Identification of Key Nodes in Network-based Epidemic Models. CoRR abs/2306.00606 (2023) - 2022
- [i10]Matteo Ceccarello, Anton Dignös, Johann Gamper, Christina Khnaisser:
Indexing Temporal Relations for Range-Duration Queries. CoRR abs/2206.07428 (2022) - 2020
- [i9]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints. CoRR abs/2002.03175 (2020) - 2019
- [i8]Martin Aumüller, Matteo Ceccarello:
The Role of Local Intrinsic Dimensionality in Benchmarking Nearest Neighbor Search. CoRR abs/1907.07387 (2019) - 2018
- [i7]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci:
Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially. CoRR abs/1802.09205 (2018) - [i6]Matteo Ceccarello, Anne Driemel, Francesco Silvestri:
FRESH: Fréchet Similarity with Hashing. CoRR abs/1809.02350 (2018) - 2016
- [i5]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension. CoRR abs/1605.05590 (2016) - [i4]Matteo Ceccarello, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin:
Clustering Uncertain Graphs. CoRR abs/1612.06675 (2016) - 2015
- [i3]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs. CoRR abs/1506.03265 (2015) - 2014
- [i2]Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space. CoRR abs/1407.3144 (2014) - [i1]Matteo Ceccarello, Francesco Silvestri:
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. CoRR abs/1408.2858 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
