Search Results for author:
Found 2 papers, 1 papers with code
Training-Time Attacks against k-Nearest Neighbors
We distill this goal to the task of performing a training-set data insertion attack against $k$-Nearest Neighbor classification ($k$NN).
It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems
In light of Ng and Hirschberg's NP-hardness result for $3$GSM and $3$PSA, we initiate the study of approximate versions of these problems.
Computational Complexity Data Structures and Algorithms
Cannot find the paper you are looking for? You can
Submit a new open access paper.
