On the public citation graph
FANNG: Fast Approximate Nearest Neighbour Graphs
0 signed · 153 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.1007/11764298_8openalex-snapshot
Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
inferredcites →https://doi.org/10.1007/bf00977785openalex-snapshot
Two algorithms for constructing a Delaunay triangulation
inferredcites →https://doi.org/10.1007/s10958-012-0714-6openalex-snapshot
Minimum—weight perfect matching for nonintrinsic distances on the line
inferredcites →https://doi.org/10.1016/j.cviu.2007.09.014openalex-snapshot
Speeded-Up Robust Features (SURF)
inferredcites →https://doi.org/10.1016/j.is.2013.10.006openalex-snapshot
Approximate nearest neighbor algorithm based on navigable small world graphs
inferredcites →https://doi.org/10.1023/a:1011139631724openalex-snapshot
Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope
inferredcites →https://doi.org/10.1023/b:visi.0000029664.99615.94openalex-snapshot
Distinctive Image Features from Scale-Invariant Keypoints
inferredcites →https://doi.org/10.1109/cvpr.1997.609451openalex-snapshot
Shape indexing using approximate nearest-neighbour search in high-dimensional spaces
inferredcites →https://doi.org/10.1109/cvpr.2006.264openalex-snapshot
Scalable Recognition with a Vocabulary Tree
inferredcites →https://doi.org/10.1109/cvpr.2008.4587638openalex-snapshot
Optimised KD-trees for fast image descriptor matching
inferredcites →https://doi.org/10.1109/cvpr.2012.6247790openalex-snapshot
Scalable k-NN graph construction for visual descriptors
inferredcites →https://doi.org/10.1109/cvpr.2013.379openalex-snapshot
Optimized Product Quantization for Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/cvpr.2014.298openalex-snapshot
Locally Optimized Product Quantization for Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/cvpr.2014.8openalex-snapshot
Fast and Accurate Image Matching with Cascade Hashing for 3D Reconstruction
inferredcites →https://doi.org/10.1109/focs.2006.49openalex-snapshot
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
inferredcites →https://doi.org/10.1109/icassp.2011.5946540openalex-snapshot
Searching in one billion vectors: Re-rank with source coding
inferredcites →https://doi.org/10.1109/iccv.2003.1238424openalex-snapshot
Fast pose estimation with parameter-sensitive hashing
inferredcites →https://doi.org/10.1109/iccv.2009.5459354openalex-snapshot
Efficient indexing for large scale visual search
inferredcites →https://doi.org/10.1109/robot.2005.1570189openalex-snapshot
SLAM-Loop Closing with Visually Salient Features
inferredcites →https://doi.org/10.1109/tpami.2010.57openalex-snapshot
Product Quantization for Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/tpami.2014.2321376openalex-snapshot
Scalable Nearest Neighbor Algorithms for High Dimensional Data
inferredcites →https://doi.org/10.1145/1327452.1327494openalex-snapshot
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
inferredcites →https://doi.org/10.1145/1963405.1963487openalex-snapshot
Efficient k-nearest neighbor graph construction for generic similarity measures
inferredcites →https://doi.org/10.14778/2824032.2824059openalex-snapshot
Permutation search methods are efficient, yet faster search is possible
inferredcites →https://doi.org/10.5220/0001787803310340openalex-snapshot
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cta.2997openalex-snapshot
Stable image matching for 3D reconstruction in outdoor
inferred← citeshttps://doi.org/10.1007/978-3-030-02224-2_2openalex-snapshot
Performance Analysis of Graph-Based Methods for Exact and Approximate Similarity Search in Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-32047-8_12openalex-snapshot
Accurate and Fast Retrieval for Complex Non-metric Data via Neighborhood Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-73216-5_29openalex-snapshot
Approximate Nearest Neighbor Search Using Query-Directed Dense Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-86475-0_22openalex-snapshot
LGTM: A Fast and Accurate kNN Search Algorithm in High-Dimensional Spaces
inferred← citeshttps://doi.org/10.1007/978-3-031-09396-8_6openalex-snapshot
Open Challenges and Conclusion
inferred← citeshttps://doi.org/10.1007/978-3-031-09917-5_6openalex-snapshot
Similarity Search with Graph Index on Directed Social Network Embedding
inferred← citeshttps://doi.org/10.1007/978-3-031-42478-6_6openalex-snapshot
An Active Storage System for Intelligent Data Analysis and Management
inferred← citeshttps://doi.org/10.1007/978-3-031-54528-3_25openalex-snapshot
Probabilistic Inference Based Incremental Graph Index for Similarity Search on Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-55182-6openalex-snapshot
Foundations of Vector Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-031-75823-2_1openalex-snapshot
An Efficient Framework for Approximate Nearest Neighbor Search on High-Dimensional Multi-metric Data
inferred← citeshttps://doi.org/10.1007/978-981-33-6632-9_3openalex-snapshot
Development of an Algorithm for Determining the Railway Tracks on Video Image
inferred← citeshttps://doi.org/10.1007/978-981-96-0351-0_8openalex-snapshot
Approximate Nearest Neighbour Search on Dynamic Datasets: An Investigation
inferred← citeshttps://doi.org/10.1007/978-981-96-0821-8_1openalex-snapshot
Verifiable Graph-Based Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/978-981-96-9961-2_26openalex-snapshot
Hierarchical Clustering-Based High-Performance Adjacency Graph Search Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-97-7707-5_19openalex-snapshot
High-Dimensional Nearest Neighbor Search-Based Blocking in Entity Resolution
inferred← citeshttps://doi.org/10.1007/s00778-022-00729-1openalex-snapshot
Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces
inferred← citeshttps://doi.org/10.1007/s00778-024-00864-xopenalex-snapshot
Survey of vector database management systems
inferred← citeshttps://doi.org/10.1007/s10559-017-9966-yopenalex-snapshot
Distance-Based Index Structures for Fast Similarity Search
inferred← citeshttps://doi.org/10.1007/s11042-017-4611-3openalex-snapshot
Game theoretic decision making in IoT-assisted activity monitoring of defence personnel
inferred← citeshttps://doi.org/10.1007/s11042-022-12248-wopenalex-snapshot
A genetic programming approach for searching on nearest neighbors graphs
inferred← citeshttps://doi.org/10.1007/s11042-023-14825-zopenalex-snapshot
An efficient indexing technique for billion-scale nearest neighbor search
inferred← citeshttps://doi.org/10.1007/s12652-017-0507-3openalex-snapshot
Internet of Things based activity surveillance of defence personnel
inferred← citeshttps://doi.org/10.1007/s41315-020-00152-1openalex-snapshot
Handling crowdsourced data using state space discretization for robot learning and synthesizing physical skills
inferred← citeshttps://doi.org/10.1007/s41781-024-00117-0openalex-snapshot
Real-Time Graph Building on FPGAs for Machine Learning Trigger Applications in Particle Physics
inferred← citeshttps://doi.org/10.1007/s42514-022-00103-1openalex-snapshot
Cognitive SSD+: a deep learning engine for energy-efficient unstructured data retrieval
inferred← citeshttps://doi.org/10.1016/j.ins.2021.10.027openalex-snapshot
HCTree+: A workload-guided index for approximate k NN search
inferred← citeshttps://doi.org/10.1016/j.is.2020.101507openalex-snapshot
A survey on graph-based methods for similarity searches in metric spaces
inferred← citeshttps://doi.org/10.1016/j.knosys.2021.107305openalex-snapshot
Two-stage routing with optimized guided search and greedy algorithm on proximity graph
inferred← citeshttps://doi.org/10.1016/j.patcog.2019.106970openalex-snapshot
Hierarchical Clustering-Based Graphs for Large Scale Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1016/j.patcog.2025.111805openalex-snapshot
A storage-efficient LSH scheme for high-dimensional ANN search
inferred← citeshttps://doi.org/10.1016/j.sysarc.2025.103514openalex-snapshot
GHVSA: Graph-based high-dimensional vector search accelerator
inferred← citeshttps://doi.org/10.1108/ijwis-12-2023-0255openalex-snapshot
Similarity search on social networks with incremental graph indexing based on probabilistic inference
inferred← citeshttps://doi.org/10.1109/2575-8411.2026.00102openalex-snapshot
cGraph: A Compact and Efficient Graph-Based Index for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/bigdata55660.2022.10020690openalex-snapshot
Scalable and Accurate Density-Peaks Clustering on Fully Dynamic Data
inferred← citeshttps://doi.org/10.1109/cvpr.2018.00353openalex-snapshot
Low-Shot Learning with Large-Scale Diffusion
inferred← citeshttps://doi.org/10.1109/hpca53966.2022.00021openalex-snapshot
ANNA: Specialized Architecture for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/iccv.2017.307openalex-snapshot
Smart Mining for Deep Metric Learning
inferred← citeshttps://doi.org/10.1109/iccwamtip64812.2024.10873693openalex-snapshot
Quick and Efficient Large Scale Approximate Nearest Neighbor Search on High-Dimensional Data
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00046openalex-snapshot
GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00233openalex-snapshot
LAN: Learning-based Approximate k-Nearest Neighbor Search in Graph Databases
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00087openalex-snapshot
Effective and General Distance Computation for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00037openalex-snapshot
PRO-HNSW: Proactive Repair and Optimization for High-Performance Dynamic HNSW Indexes
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00125openalex-snapshot
Overcoming the Sync-Compute Dilemma in Parallel Graph-Based Vector Retrieval
inferred← citeshttps://doi.org/10.1109/icdew71238.2026.00018openalex-snapshot
VecAlign: Efficient Vector Sequence Alignment for Similarity Search in the Embedding Space
inferred← citeshttps://doi.org/10.1109/icip.2018.8451297openalex-snapshot
Deep Metric Learning and Image Classification with Nearest Neighbour Gaussian Kernels
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9196827openalex-snapshot
Fast, Compact and Highly Scalable Visual Place Recognition through Sequence-based Matching of Overloaded Representations
inferred← citeshttps://doi.org/10.1109/iiswc66894.2025.00041openalex-snapshot
Storage-Based Approximate Nearest Neighbor Search: What are the Performance, Cost, and I/O Characteristics?
inferred← citeshttps://doi.org/10.1109/ispa67752.2025.00070openalex-snapshot
Distributed Graph-Based Approximate Nearest Neighbor Search Index Construction via Task Parallelism
inferred← citeshttps://doi.org/10.1109/jiot.2025.3615991openalex-snapshot
A Triplet-Learning-Based Framework for Cross-Version Smart Contract Vulnerability Detection
inferred← citeshttps://doi.org/10.1109/lra.2021.3067633openalex-snapshot
SeqNet: Learning Descriptors for Sequence-Based Hierarchical Place Recognition
inferred← citeshttps://doi.org/10.1109/tbdata.2021.3101517openalex-snapshot
On the Merge of k-NN Graph
inferred← citeshttps://doi.org/10.1109/tbdata.2022.3161156openalex-snapshot
GGNN: Graph-Based GPU Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/tits.2022.3175656openalex-snapshot
The Revisiting Problem in Simultaneous Localization and Mapping: A Survey on Visual Loop Closure Detection
inferred← citeshttps://doi.org/10.1109/tkde.2019.2953897openalex-snapshot
A Revisit of Hashing Algorithms for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/tkde.2022.3220683openalex-snapshot
Deep Learning for Approximate Nearest Neighbour Search: A Survey and Future Directions
inferred← citeshttps://doi.org/10.1109/tkde.2024.3408815openalex-snapshot
Optimizing the Number of Clusters for Billion-Scale Quantization-Based Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/tkde.2026.3676465openalex-snapshot
STABLE: Efficient Hybrid Nearest Neighbor Search via Magnitude-Uniformity and Cardinality-Robustness
inferred← citeshttps://doi.org/10.1109/tmm.2021.3073811openalex-snapshot
Approximate k-NN Graph Construction: A Generic Online Approach
inferred← citeshttps://doi.org/10.1109/tpami.2018.2889473openalex-snapshot
Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs
inferred← citeshttps://doi.org/10.1109/tpami.2019.2906603openalex-snapshot
Social Anchor-Unit Graph Regularized Tensor Completion for Large-Scale Image Retagging
inferred← citeshttps://doi.org/10.1109/tpami.2019.2944597openalex-snapshot
A Graph-Based Approach for Making Consensus-Based Decisions in Image Search and Person Re-Identification
inferred← citeshttps://doi.org/10.1109/tpami.2021.3067706openalex-snapshot
High Dimensional Similarity Search with Satellite System Graph: Efficiency, Scalability, and Unindexed Query Compatibility
inferred← citeshttps://doi.org/10.1109/trustcom66490.2025.00187openalex-snapshot
VLAH: A Lightweight and Verifiable Framework for Approximate Nearest Neighbor Search in High-Dimensional Space
inferred← citeshttps://doi.org/10.1109/tsmc.2023.3234227openalex-snapshot
Proposing a Dimensionality Reduction Technique With an Inequality for Unsupervised Learning from High-Dimensional Big Data
inferred← citeshttps://doi.org/10.1145/3126686.3126711openalex-snapshot
An Evaluation of Large-scale Methods for Image Instance and Class Discovery
inferred← citeshttps://doi.org/10.1145/3323873.3325014openalex-snapshot
A Genetic Programming Approach for Searching on Nearest Neighbors Graphs
inferred← citeshttps://doi.org/10.1145/3357384.3357834openalex-snapshot
Large-Scale Visual Search with Binary Distributed Graph at Alibaba
inferred← citeshttps://doi.org/10.1145/3543622.3573189openalex-snapshot
FNNG: A High-Performance FPGA-based Accelerator for K-Nearest Neighbor Graph Construction
inferred← citeshttps://doi.org/10.1145/3581783.3612290openalex-snapshot
Relative NN-Descent: A Fast Index Construction for Graph-Based Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3588908openalex-snapshot
Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases
inferred← citeshttps://doi.org/10.1145/3627535.3638475openalex-snapshot
ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms
inferred← citeshttps://doi.org/10.1145/3652583.3658117openalex-snapshot
An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval
inferred← citeshttps://doi.org/10.1145/3689031.3717460openalex-snapshot
Groot: Graph-Centric Row Reordering with Tree for Sparse Matrix Multiplications on Tensor Cores
inferred← citeshttps://doi.org/10.1145/3698814openalex-snapshot
iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3709679openalex-snapshot
DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph
inferred← citeshttps://doi.org/10.1145/3709693openalex-snapshot
Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art
inferred← citeshttps://doi.org/10.1145/3709730openalex-snapshot
SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3710848.3710867openalex-snapshot
PANNS: Enhancing Graph-based Approximate Nearest Neighbor Search through Recency-aware Construction and Parameterized Search
inferred← citeshttps://doi.org/10.1145/3711896.3736930openalex-snapshot
Empowering Graph-based Approximate Nearest Neighbor Search with Adaptive Awareness Capabilities
inferred← citeshttps://doi.org/10.1145/3711896.3736997openalex-snapshot
Hi-PNG: Efficient Interval-Filtering ANNS via Hierarchical Interval Partition Navigating Graph
inferred← citeshttps://doi.org/10.1145/3726302.3729996openalex-snapshot
Highly Efficient Disk-based Nearest Neighbor Search on Extended Neighborhood Graph
inferred← citeshttps://doi.org/10.1145/3736589openalex-snapshot
A SmartSSD-based Near Data Processing Architecture for Scalable Billion-point Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3746252.3761421openalex-snapshot
InstANNS: Scalable Approximate Nearest Neighbor Search via Cost-Efficient In-Storage Processing
inferred← citeshttps://doi.org/10.1145/3767716openalex-snapshot
Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation
inferred← citeshttps://doi.org/10.1145/3769783openalex-snapshot
Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3769799openalex-snapshot
High-Throughput, Cost-Effective Billion-Scale Vector Search with a Single GPU
inferred← citeshttps://doi.org/10.1145/3774904.3792396openalex-snapshot
BANCO: Drift-Aware Batched Bandits for Adaptive Proximity Graph Pruning
inferred← citeshttps://doi.org/10.1145/3786635openalex-snapshot
Curator: Efficient Vector Search with Low-Selectivity Filters
inferred← citeshttps://doi.org/10.1145/3786639openalex-snapshot
Distribution-Aware Exploration for Adaptive HNSW Search
inferred← citeshttps://doi.org/10.1145/3786643openalex-snapshot
Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph
inferred← citeshttps://doi.org/10.1145/3789265openalex-snapshot
Efficient Time-Restricted k NN Search in High-Dimensional Data Using Multi-Level Block Indexing, with Extensions to Multi-Attribute Filtering
inferred← citeshttps://doi.org/10.1145/3805712.3809731openalex-snapshot
Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
inferred← citeshttps://doi.org/10.1145/3816782.3819219openalex-snapshot
CleanANN: Efficient and Robust Full Dynamism in Graph-based Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1186/s40537-025-01096-8openalex-snapshot
Machine learning-based interactive dynamic resilience assessment for complex hydropower systems
inferred← citeshttps://doi.org/10.1214/22-ejs2076openalex-snapshot
Optimal detection of the feature matching map in presence of noise and outliers
inferred← citeshttps://doi.org/10.14778/3303753.3303754openalex-snapshot
Fast approximate nearest neighbor search with the navigating spreading-out graph
inferred← citeshttps://doi.org/10.14778/3476249.3476255openalex-snapshot
A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search
inferred← citeshttps://doi.org/10.14778/3594512.3594527openalex-snapshot
Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces
inferred← citeshttps://doi.org/10.14778/3704965.3704974openalex-snapshot
Steiner -Hardness: A Query Hardness Measure for Graph-Based ANN Indexes
inferred← citeshttps://doi.org/10.14778/3725688.3725696openalex-snapshot
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
inferred← citeshttps://doi.org/10.14778/3785297.3785304openalex-snapshot
Elastic Index Selection for Label-Hybrid AKNN Search
inferred← citeshttps://doi.org/10.14778/3801059.3801067openalex-snapshot
JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.14778/3828612.3828642openalex-snapshot
HEXA: A Disjoint-Subgraph-Based Indexing Framework for Approximate Nearest Neighbor Search at Billion Scale
inferred← citeshttps://doi.org/10.14778/3836663.3836702openalex-snapshot
BBC: Improving Large- k Approximate Nearest Neighbor Search with a Bucket-Based Result Collector
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12138openalex-snapshot
Fast Approximate Nearest Neighbor Search via k-Diverse Nearest Neighbor Graph
inferred← citeshttps://doi.org/10.1609/aaai.v34i01.5344openalex-snapshot
Understanding and Improving Proximity Graph Based Maximum Inner Product Search
inferred← citeshttps://doi.org/10.1609/aaai.v36i4.20356openalex-snapshot
Anisotropic Additive Quantization for Fast Inner Product Search
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25613openalex-snapshot
Query-Aware Quantization for Maximum Inner Product Search
inferred← citeshttps://doi.org/10.23919/ascc56756.2022.9828011openalex-snapshot
Loop Closure Detection with Incremental Proximity Graph and Multi-words Quantization
inferred← citeshttps://doi.org/10.32657/10356/181650openalex-snapshot
Efficient approximate nearest neighbor search on high-dimensional vectors by graph and quantization
inferred← citeshttps://doi.org/10.3390/app152111540openalex-snapshot
Reference-Vector Removed Product Quantization for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.3390/bdcc9100254openalex-snapshot
Fast Adaptive Approximate Nearest Neighbor Search with Cluster-Shaped Indices
inferred← citeshttps://doi.org/10.3390/s23020629openalex-snapshot
Survey on Exact kNN Queries over High-Dimensional Data Space
inferred← citeshttps://doi.org/10.3724/sp.j.1249.2023.06640openalex-snapshot
RPA: a memory-efficient metric-space recall@R ANNS index
inferred← citeshttps://doi.org/10.47749/t/unicamp.2020.1129107openalex-snapshot
Large-scale indexing of high dimensional data via nearest neighbor graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1603.09320openalex-snapshot
Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1804.03032openalex-snapshot
Approximate k-NN Graph Construction: a Generic Online Approach
inferred← citeshttps://doi.org/10.48550/arxiv.1904.02077openalex-snapshot
Graph based Nearest Neighbor Search: Promises and Failures
inferred← citeshttps://doi.org/10.48550/arxiv.1906.10602openalex-snapshot
Pyramid: A General Framework for Distributed Similarity Search
inferred← citeshttps://doi.org/10.48550/arxiv.2012.11083openalex-snapshot
A Note on Graph-Based Nearest Neighbor Search
inferred← citeshttps://doi.org/10.48550/arxiv.2110.08919openalex-snapshot
Low-Precision Quantization for Efficient Nearest Neighbor Search
inferred← citeshttps://doi.org/10.48550/arxiv.2110.08959openalex-snapshot
Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach
inferred← citeshttps://doi.org/10.5505/pajes.2017.92604openalex-snapshot
Object detection with BRIEF descriptors and locality sensitive matching for augmented reality
inferred← citeshttps://doi.org/10.70675/e13d381ez4895z4195z8368zb242f219c1d0openalex-snapshot
High-order statistics for image representations in metric learning
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.