4 papers
Round-efficient Fully-scalable MPC algorithms for k-Means
Shaofeng H. -C. Jiang, Yaonan Jin, Jianing Lou +1
We study Euclidean -Means under the Massively Parallel Computation (MPC) model, focusing on the \emph{fully-scalable} setting. Our main result is a fully-scalable $O((\log n/\lo…
Fully Dynamic Algorithms for Chamfer Distance
Gramoz Goranci, Shaofeng Jiang, Peter Kiss +2
We study the problem of computing Chamfer distance in the fully dynamic setting, where two set of points , each of size up to , dynamically evolve t…
Tree Embedding in High Dimensions: Dynamic and Massively Parallel
Gramoz Goranci, Shaofeng H. -C. Jiang, Peter Kiss +3
Tree embedding has been a fundamental method in algorithm design with wide applications. We focus on the efficiency of building tree embedding in various computational settings und…
On The Relative Error of Random Fourier Features for Preserving Kernel Distance
Kuan Cheng, Shaofeng H. -C. Jiang, Luojian Wei +1
The method of random Fourier features (RFF), proposed in a seminal paper by Rahimi and Recht (NIPS'07), is a powerful technique to find approximate low-dimensional representations…