Dan Feldman

Scalable Secure Computation of Statistical Functions with Applications to k-Nearest Neighbors.

2018 · arXiv (Cornell University)

Given a set $S$ of $n$ $d$-dimensional points, the $k$-nearest neighbors (KNN) is the problem of quickly finding $k$ points in $S$ that are nearest to a query point $q$. The $k$-nearest neighbors problem has …

Introduction to Coresets: Accurate Coresets

2019 · arXiv (Cornell University)

A coreset (or core-set) of an input set is its small summation, such that solving a problem on the coreset as its input, provably yields the same result as solving the same problem on the …