Robuta

https://arxiv.org/abs/1609.07228
Abstract page for arXiv paper 1609.07228: EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph
nearest neighbor searchextremelyfastapproximate
https://openreview.net/forum?id=yQcFniousM&referrer=%5Bthe%20profile%20of%20Elaine%20Shi%5D(%2Fprofile%3Fid%3D~Elaine_Shi1)
We propose a new private Approximate Nearest Neighbor (ANN) search scheme named Pacmann that allows a client to perform ANN search in a vector database without...
nearest neighbor searchefficientprivateapproximate
https://scirp.org/journal/papercitationdetails?paperid=109634&JournalID=2463
The traveling salesman problem (TSP) is the most popular and most studied non-deterministic polynomial (NP) hard problem that has been used in various fields...
nearest neighborsimulated annealingsearch optimizationrepetitivebased