Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, `1 , `2 and `1 distances. All our algorit
Add to Reading List
Document Date: 2018-04-02 11:03:41
Open Document
File Size: 135,32 KB
Share Result on Facebook
UPDATE
We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, `1 , `2 and `1 distances. All our algorit