On the public citation graph

A distributed kernel summation framework for general‐dimension machine learning

https://doi.org/10.1002/sam.11207
0 signed · 48 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nme.2972openalex-snapshot
PetFMM—A dynamically load‐balancing parallel fast multipole library
inferredcites →https://doi.org/10.1006/jpdc.1995.1077openalex-snapshot
Load Balancing and Data Locality in Adaptive Hierarchical N-Body Methods: Barnes-Hut, Fast Multipole, and Radiosity
inferredcites →https://doi.org/10.1007/10849171_5openalex-snapshot
Fast Algorithms and Efficient Statistics: N-Point Correlation Functions
inferredcites →https://doi.org/10.1007/978-1-4419-7719-9_6openalex-snapshot
Boost C++ Libraries
inferredcites →https://doi.org/10.1016/0021-9991(87)90140-9openalex-snapshot
A fast algorithm for particle simulations
inferredcites →https://doi.org/10.1016/j.jcp.2003.11.021openalex-snapshot
A kernel-independent adaptive fast multipole algorithm in two and three dimensions
inferredcites →https://doi.org/10.1038/324446a0openalex-snapshot
A hierarchical O(N log N) force-calculation algorithm
inferredcites →https://doi.org/10.1086/301513openalex-snapshot
The Sloan Digital Sky Survey: Technical Summary
inferredcites →https://doi.org/10.1109/71.841750openalex-snapshot
Parallel construction of multidimensional binary search trees
inferredcites →https://doi.org/10.1109/88.532137openalex-snapshot
How network topology affects dynamic loading balancing
inferredcites →https://doi.org/10.1109/iccv.2003.1238383openalex-snapshot
Improved fast gauss transform and efficient kernel density estimation
inferredcites →https://doi.org/10.1109/icpp.1997.622577openalex-snapshot
A framework for parallel tree-based scientific simulations
inferredcites →https://doi.org/10.1109/sc.2010.39openalex-snapshot
Parallel Fast Gauss Transform
inferredcites →https://doi.org/10.1109/wacv.2007.18openalex-snapshot
Clustering Billions of Images with Large Scale Nearest Neighbor Search
inferredcites →https://doi.org/10.1137/0906008openalex-snapshot
An Efficient Program for Many-Body Simulation
inferredcites →https://doi.org/10.1137/0912004openalex-snapshot
The Fast Gauss Transform
inferredcites →https://doi.org/10.1137/1.9781611972788.19openalex-snapshot
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
inferredcites →https://doi.org/10.1137/1109020openalex-snapshot
On Estimating Regression
inferredcites →https://doi.org/10.1145/1143844.1143857openalex-snapshot
Cover trees for nearest neighbor
inferredcites →https://doi.org/10.1145/1374376.1374452openalex-snapshot
Random projection trees and low dimensional manifolds
inferredcites →https://doi.org/10.1145/1572769openalex-snapshot
Proceedings of the Conference on High Performance Graphics 2009
inferredcites →https://doi.org/10.1145/1654059.1654118openalex-snapshot
A massively parallel adaptive fast-multipole method on heterogeneous architectures
inferredcites →https://doi.org/10.1145/200836.200853openalex-snapshot
A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
inferredcites →https://doi.org/10.1145/201045.201050openalex-snapshot
Implications of hierarchical N-body methods for multiprocessor architectures
inferredcites →https://doi.org/10.1145/3564246openalex-snapshot
Proceedings of the 55th Annual ACM Symposium on Theory of Computing
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1162/089976698300017467openalex-snapshot
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
inferredcites →https://doi.org/10.1214/aoms/1177704472openalex-snapshot
On Estimation of a Probability Density Function and Mode
inferredcites →https://doi.org/10.48550/arxiv.1102.2878openalex-snapshot
Dual-Tree Fast Gauss Transforms
inferredcites →https://doi.org/10.52202/085713openalex-snapshot
Advances in Neural Information Processing Systems 19
inferredcites →https://doi.org/10.5555/313559.313789openalex-snapshot
Data structures and algorithms for nearest neighbor search in general metric spaces
inferredcites →https://doi.org/10.5555/645529.657980openalex-snapshot
Sparse Greedy Matrix Approximation for Machine Learning
inferredcites →https://doi.org/10.5840/jphil2024121312openalex-snapshot
Optimization and Beyond
inferredcites →https://doi.org/10.7551/mitpress/1556.003.0013openalex-snapshot
Parallel Programming with MPI
inferredcites →https://doi.org/10.7551/mitpress/4175.001.0001openalex-snapshot
Learning with Kernels
inferredcites →https://doi.org/10.7907/3j5v-vr08.openalex-snapshot
Parallel hierarchical N-body methods

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4855124openalex-extracted
Density Forecasts with Local Quantile Projection and Quantile Vector Autoregression Applied to Inflation
inferred← citeshttps://doi.org/10.1002/sam.11218openalex-snapshot
Dual‐tree fast exact max‐kernel search
inferred← citeshttps://doi.org/10.1016/j.jcp.2019.07.027openalex-snapshot
An O ( N log N ) hierarchical random compression method for kernel matrices by sampling partial matrix entries
inferred← citeshttps://doi.org/10.1016/j.jcp.2023.112491openalex-snapshot
A hybrid stochastic interpolation and compression method for kernel matrices
inferred← citeshttps://doi.org/10.1080/10618600.2018.1549052openalex-snapshot
Fast and Stable Multivariate Kernel Density Estimation by Fast Sum Updating
inferred← citeshttps://doi.org/10.1109/ipdps.2015.86openalex-snapshot
An Algebraic Parallel Treecode in Arbitrary Dimensions
inferred← citeshttps://doi.org/10.1109/tcad.2022.3197535openalex-snapshot
CASPHAr: Cache-Managed Accelerator Staging and Pipelining in Heterogeneous System Architectures
inferred← citeshttps://doi.org/10.1109/tpds.2021.3056045openalex-snapshot
Hardware Accelerator Integration Tradeoffs for High-Performance Computing: A Case Study of GEMM Acceleration in N-Body Methods
inferred← citeshttps://doi.org/10.1137/140989546openalex-snapshot
ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions
inferred← citeshttps://doi.org/10.1137/15m1026468openalex-snapshot
ASKIT: An Efficient, Parallel Library for High-Dimensional Kernel Summations
inferred← citeshttps://doi.org/10.1145/2807591.2807647openalex-snapshot
A kernel-independent FMM in general dimensions
inferred← citeshttps://doi.org/10.48550/arxiv.1803.05050openalex-snapshot
A hierarchical random compression method for kernel matrices
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.