—Traditional approaches to K-anonymity provide privacy guarantees over publicly released data sets with specified quasi-identifiers. However, the most common public releases of...
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...