11 citations · 23 across the 13 of their papers we have counts for
4 papers · 1 filter
Attacking Shortest Paths by Cutting Edges
Benjamin A. Miller, Zohair Shafi, Wheeler Ruml +3
Identifying shortest paths between nodes in a network is a common graph analysis problem that is important for many applications involving routing of resources. An adversary that c…
A Visual Active Search Framework for Geospatial Exploration
Anindya Sarkar, Michael Lanier, Scott Alfeld +4
Many problems can be viewed as forms of geospatial search aided by aerial imagery, with examples ranging from detecting poaching activity to human trafficking. We model this class…
Training-Time Attacks against k-Nearest Neighbors
Ara Vartanian, Will Rosenbaum, Scott Alfeld
Nearest neighbor-based methods are commonly used for classification tasks and as subroutines of other data-analysis methods. An attacker with the capability of inserting their own…
Approximate Data Deletion in Generative Models
Zhifeng Kong, Scott Alfeld
Users have the right to have their data deleted by third-party learned systems, as codified by recent legislation such as the General Data Protection Regulation (GDPR) and the Cali…