7 citations · 18 across the 6 of their papers we have counts for
3 papers · 1 filter
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…
Tree-Independent Dual-Tree Algorithms
Ryan R. Curtin, William B. March, Parikshit Ram +3
Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often compl…
Fast Exact Max-Kernel Search
Ryan R. Curtin, Parikshit Ram, Alexander G. Gray
The wide applicability of kernels makes the problem of max-kernel search ubiquitous and more general than the usual similarity search in metric spaces. We focus on solving this pro…