Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8898203 | Applied and Computational Harmonic Analysis | 2018 | 20 Pages |
Abstract
We also present an optimal algorithm for building a single FRT tree, whose running time is bounded independently of all problem parameters other than the number of points. We conclude by demonstrating our theoretical results on a numerical example, and applying them to the approximation of the Earth Mover's Distance between probability distributions.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
William Leeb,