7 citations · 7 across the 1 of their papers we have counts for
2 papers
cs.DS2013★ 7 cited
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…
cs.DS2012
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…