Ryan R. Curtin

activity

20122023

most citedDetecting Adversarial Samples from Artifacts

366 citations · 699 across the 19 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.DS2016

Fast approximate furthest neighbors with data-dependent hashing

Ryan R. Curtin, Andrew B. Gardner

We present a novel hashing strategy for approximate furthest neighbor search that selects projection bases using the data distribution. This strategy leads to an algorithm, which w…

cs.DS2016

Dual-tree $k$ -means with bounded iteration runtime

Ryan R. Curtin

k-means is a widely used clustering algorithm, but for $k$ clusters and a dataset size of $N$ , each iteration of Lloyd's algorithm costs $O (k N)$ time. Although there are existing t…

Fast approximate furthest neighbors with data-dependent hashing

Dual-tree k-means with bounded iteration runtime

Dual-tree $k$ -means with bounded iteration runtime