Finding Friends and Followers in Sub-linear Time (2009)
Arthur, David, Oudot, Steve, Sharma, Anneesh
The approximate Nearest Neighbor (NN) search problem asks to pre-process a given set of points $P$ in such a way that, given any query point $q$, one can retrieve a point in $P$ that is approximately...
Finding Friends and Followers in Sub-linear Time (2009)
Arthur, David, Oudot, Steve, Sharma, Anneesh
The approximate Nearest Neighbor (NN) search problem asks to pre-process a given set of points $P$ in such a way that, given any query point $q$, one can retrieve a point in $P$ that is approximately...
Finding Friends and Followers in Sub-linear Time (2009)
Arthur, David, Oudot, Steve, Sharma, Anneesh
The approximate Nearest Neighbor (NN) search problem asks to pre-process a given set of points $P$ in such a way that, given any query point $q$, one can retrieve a point in $P$ that is approximately...
Finding Friends and Followers in Sub-linear Time (2009)
Arthur, David, Oudot, Steve, Sharma, Anneesh
The approximate Nearest Neighbor (NN) search problem asks to pre-process a given set of points $P$ in such a way that, given any query point $q$, one can retrieve a point in $P$ that is approximately...