Pages that link to "Item:Q5254484"
From MaRDI portal
The following pages link to ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions (Q5254484):
Displaying 13 items.
- Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication (Q2087418) (← links)
- An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries (Q2222486) (← links)
- Far-field compression for fast kernel summation methods in high dimensions (Q2397164) (← links)
- Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions (Q2830635) (← links)
- ASKIT: An Efficient, Parallel Library for High-Dimensional Kernel Summations (Q2830640) (← links)
- (Q4636971) (← links)
- A Fast Tunable Blurring Algorithm for Scattered Data (Q5132031) (← links)
- A Kernel-Independent Treecode Based on Barycentric Lagrange Interpolation (Q5162347) (← links)
- Interpolative Decomposition via Proxy Points for Kernel Matrices (Q5217103) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- Linear-Cost Covariance Functions for Gaussian Random Fields (Q6107197) (← links)
- Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations (Q6114955) (← links)
- Fast kernel summation in high dimensions via slicing and Fourier transforms (Q6655077) (← links)
