On the public citation graph
Accounting for boundary effects in nearest-neighbor searching
0 signed · 43 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9781405186407.wbieci023.pub2openalex-snapshot
Information Processing
inferredcites →https://doi.org/10.1007/978-1-4615-3626-0openalex-snapshot
Vector Quantization and Signal Compression
inferredcites →https://doi.org/10.1007/bf01759061openalex-snapshot
Refinements to nearest-neighbor searching ink-dimensional trees
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/0016-0032(60)90125-3openalex-snapshot
Some mathematical methods of physics
inferredcites →https://doi.org/10.1016/c2013-0-10310-8openalex-snapshot
Mathematical Methods for Physicists
inferredcites →https://doi.org/10.1109/dcc.1993.253111openalex-snapshot
Algorithms for fast vector quantization
inferredcites →https://doi.org/10.1119/1.1973757openalex-snapshot
Mathematical Methods for Physicists
inferredcites →https://doi.org/10.1119/1.1988084openalex-snapshot
Mathematical Methods for Physicists
inferredcites →https://doi.org/10.1145/177424.177609openalex-snapshot
An algorithm for approximate closest-point queries
inferredcites →https://doi.org/10.1145/293347.293348openalex-snapshot
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
inferredcites →https://doi.org/10.1145/355744.355745openalex-snapshot
An Algorithm for Finding Best Matches in Logarithmic Expected Time
inferredcites →https://doi.org/10.1145/355826.355832openalex-snapshot
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space
inferredcites →https://doi.org/10.1145/355921.355927openalex-snapshot
Optimal Expected-Time Algorithms for Closest Point Problems
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.2307/2314609openalex-snapshot
An Introduction to Probability Theory and Its Applications.
inferredcites →https://doi.org/10.5555/313559.313768openalex-snapshot
Approximate nearest neighbor queries in fixed dimensions
inferredcites →https://doi.org/10.5555/314464.314652openalex-snapshot
An optimal algorithm for approximate nearest neighbor searching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45545-0_96openalex-snapshot
On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_6openalex-snapshot
Randomized Algorithms for Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24618-3_20openalex-snapshot
Features of Neighbors Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-39804-2_34openalex-snapshot
Efficient Density Clustering Method for Spatial Data
inferred← citeshttps://doi.org/10.1007/978-3-642-32153-5_10openalex-snapshot
Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional General Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_14openalex-snapshot
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube
inferred← citeshttps://doi.org/10.1007/pl00009390openalex-snapshot
Approximate Nearest Neighbor Queries Revisited
inferred← citeshttps://doi.org/10.1007/s00357-015-9174-2openalex-snapshot
Classification Using the Zipfian Kernel
inferred← citeshttps://doi.org/10.1007/s10092-022-00495-0openalex-snapshot
Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.03.003openalex-snapshot
A local search approximation algorithm for k-means clustering
inferred← citeshttps://doi.org/10.1093/comjnl/bxh059openalex-snapshot
Hashing of Databases with the Use of Metric Properties of the Hamming Space
inferred← citeshttps://doi.org/10.1109/cleo.2006.4627824openalex-snapshot
Measurement of order-disorder transitions in biological samples using polarization-modulated second harmonic generation imaging
inferred← citeshttps://doi.org/10.1109/iembs.2001.1017315openalex-snapshot
Comparison of two distance based alignment methods in medical imaging
inferred← citeshttps://doi.org/10.1109/socpar.2011.6089286openalex-snapshot
Near neighbor distribution in fractal and finite sets
inferred← citeshttps://doi.org/10.1109/tcyb.2014.2305697openalex-snapshot
Correlation Dimension-Based Classifier
inferred← citeshttps://doi.org/10.1142/s0218195905001622openalex-snapshot
GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
inferred← citeshttps://doi.org/10.1145/262839.263001openalex-snapshot
Approximate nearest neighbor queries revisited
inferred← citeshttps://doi.org/10.1145/276304.276353openalex-snapshot
High-dimensional index structures database support for next decade's applications (tutorial)
inferred← citeshttps://doi.org/10.1145/301250.301325openalex-snapshot
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
inferred← citeshttps://doi.org/10.1145/513400.513402openalex-snapshot
A local search approximation algorithm for k-means clustering
inferred← citeshttps://doi.org/10.13140/2.1.2152.8964openalex-snapshot
Approximate Nearest Neighbor Search Small World Approach
inferred← citeshttps://doi.org/10.15439/2014f194openalex-snapshot
Experimental evaluation of selected tree structures for exact and approximate k-nearest neighbor classification
inferred← citeshttps://doi.org/10.25911/5d63c140f24baopenalex-snapshot
Towards visual map building, localisation, and navigation
inferred← citeshttps://doi.org/10.5772/13971openalex-snapshot
Classifiers Based on Inverted Distances
inferred← citeshttps://doi.org/10.9708/jksci.2014.19.9.001openalex-snapshot
Task Balancing Scheme of MPI Gridding for Large-scale LiDAR Data Interpolation
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.