1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2015★ 1 cited
Plug-and-play dual-tree algorithm runtime analysis
Ryan R. Curtin, Dongryeol Lee, William B. March +1
Numerous machine learning algorithms contain pairwise statistical problems at their core---that is, tasks that require computations over all pairs of input points if implemented na…
cs.DS2014
ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions
William B. March, Bo Xiao, George Biros
We present a fast algorithm for kernel summation problems in high-dimensions. These problems appear in computational physics, numerical approximation, non-parametric statistics, an…
cs.LG2014★ 1 cited
Far-Field Compression for Fast Kernel Summation Methods in High Dimensions
William B. March, George Biros
We consider fast kernel summations in high dimensions: given a large set of points in dimensions (with ) and a pair-potential function (the {\em kernel} function), we…