no code implementations • 21 Jan 2015 • Ryan R. Curtin, Dongryeol Lee, William B. March, Parikshit Ram
In this paper, we present a problem-independent runtime guarantee for any dual-tree algorithm using the cover tree, separating out the problem-dependent and the problem-independent elements.
no code implementations • 1 Oct 2014 • William B. March, Bo Xiao, George Biros
We present a fast algorithm for kernel summation problems in high-dimensions.
no code implementations • 9 Sep 2014 • William B. March, George Biros
We consider fast kernel summations in high dimensions: given a large set of points in $d$ dimensions (with $d \gg 3$) and a pair-potential function (the {\em kernel} function), we compute a weighted sum of all pairwise kernel interactions for each point in the set.