Search Results for author:
Found 4 papers, 1 papers with code
Adversarial Examples for k-Nearest Neighbor Classifiers Based on Higher-Order Voronoi Diagrams
On a high level, the search radius expands to the nearby higher-order Voronoi cells until we find a cell that classifies differently from the input point.
Adversarial Examples for $k$-Nearest Neighbor Classifiers Based on Higher-Order Voronoi Diagrams
On a high level, the search radius expands to the nearby Voronoi cells until we find a cell that classifies differently from the input point.
The Price of Tailoring the Index to Your Data: Poisoning Attacks on Learned Index Structures
In this work, we present the first study of poisoning attacks on learned index structures.
Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection
We formulate and study a fundamental search and detection problem, Schedule Optimization, motivated by a variety of real-world applications, ranging from monitoring content changes on the web, social networks, and user activities to detecting failure on large systems with many individual machines.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
