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

First Page		Document Content
Date: 2018-04-02 11:03:41		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 Source URL: vision.soic.indiana.edu Download Document from Source Website File Size: 135,32 KB Share Document on Facebook