On the public citation graph

Efficient Large-Scale Approximate Nearest Neighbor Search on the GPU

https://doi.org/10.1109/cvpr.2016.223

0 signed · 73 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.1109/18.796371openalex-snapshot

Quantization based on a novel sample-adaptive product quantizer (SAPQ)

inferredcites →https://doi.org/10.1109/cvpr.2012.6248038openalex-snapshot

The inverted multi-index

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.124openalex-snapshot

Additive Quantization for Extreme Vector Compression

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.2015.7299052openalex-snapshot

Tree quantization for large-scale similarity search and classification

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.2011.6126421openalex-snapshot

Coherency Sensitive Hashing

inferredcites →https://doi.org/10.1109/tcom.1980.1094577openalex-snapshot

An Algorithm for Vector Quantizer Design

inferredcites →https://doi.org/10.1109/tit.1982.1056489openalex-snapshot

Least squares quantization in PCM

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.1111/cgf.12715openalex-snapshot

Fast ANN for High‐Quality Collaborative Filtering

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/276698.276876openalex-snapshot

Approximate nearest neighbors

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/997817.997857openalex-snapshot

Locality-sensitive hashing scheme based on p-stable distributions

inferredcites →https://doi.org/10.2312/eggh/eggh07/097-106openalex-snapshot

Scan Primitives for GPU Computing

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-01258-8_13openalex-snapshot

Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors

inferred← citeshttps://doi.org/10.1007/s00138-018-00999-2openalex-snapshot

Improved embedding product quantization

inferred← citeshttps://doi.org/10.1007/s12626-022-00131-xopenalex-snapshot

Noise–Robust Sampling for Collaborative Metric Learning

inferred← citeshttps://doi.org/10.1007/s40747-023-00982-zopenalex-snapshot

Structure-enhanced pairwise feature learning for face clustering

inferred← citeshttps://doi.org/10.1016/j.compeleceng.2021.107002openalex-snapshot

Hierarchical quantization for billion-scale similarity retrieval on GPUs

inferred← citeshttps://doi.org/10.1016/j.engappai.2023.107274openalex-snapshot

Progressive structure enhancement graph convolutional network for face clustering

inferred← citeshttps://doi.org/10.1016/j.future.2019.04.033openalex-snapshot

Vector and line quantization for billion-scale similarity search on GPUs

inferred← citeshttps://doi.org/10.1016/j.image.2019.08.009openalex-snapshot

A supervised learning to index model for approximate nearest neighbor image retrieval

inferred← citeshttps://doi.org/10.1016/j.iot.2021.100428openalex-snapshot

GPU-aided edge computing for processing the k nearest-neighbor query on SSD-resident data

inferred← citeshttps://doi.org/10.1016/j.is.2019.101485openalex-snapshot

An empirical evaluation of exact set similarity join techniques using GPUs

inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.10.001openalex-snapshot

Online multimedia retrieval on CPU–GPU platforms with adaptive work partition

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.patrec.2019.01.012openalex-snapshot

Fast large scale deep face search

inferred← citeshttps://doi.org/10.1109/access.2018.2879337openalex-snapshot

Two-Pass K Nearest Neighbor Search for Feature Tracking

inferred← citeshttps://doi.org/10.1109/cvpr.2018.00517openalex-snapshot

Efficient Large-Scale Approximate Nearest Neighbor Search on OpenCL FPGA

inferred← citeshttps://doi.org/10.1109/cvpr42600.2020.00673openalex-snapshot

Density-Aware Feature Embedding for Face Clustering

inferred← citeshttps://doi.org/10.1109/icauc68182.2026.11441046openalex-snapshot

Efficient Image Retrieval with Vision Transformer (ViT) and FAISS

inferred← citeshttps://doi.org/10.1109/iccd56317.2022.00051openalex-snapshot

ES4D: Accelerating Exact Similarity Search for High-Dimensional Vectors via Vector Slicing and In-SSD Computation

inferred← citeshttps://doi.org/10.1109/iccv48922.2021.00382openalex-snapshot

Learn to Cluster Faces via Pairwise Classification

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/icde65448.2025.00148openalex-snapshot

LOVO: Efficient Complex Object Query in Large-Scale Video Datasets

inferred← citeshttps://doi.org/10.1109/icfpt47387.2019.00019openalex-snapshot

Accelerated Approximate Nearest Neighbors Search Through Hierarchical Product Quantization

inferred← citeshttps://doi.org/10.1109/icra40945.2020.9196682openalex-snapshot

Kidnapped Radar: Topological Radar Localisation using Rotationally-Invariant Metric Learning

inferred← citeshttps://doi.org/10.1109/tbdata.2019.2921572openalex-snapshot

Billion-Scale Similarity Search with GPUs

inferred← citeshttps://doi.org/10.1109/tbdata.2022.3161156openalex-snapshot

GGNN: Graph-Based GPU Nearest Neighbor Search

inferred← citeshttps://doi.org/10.1109/tbdata.2025.3581085openalex-snapshot

BANG: Billion-Scale Approximate Nearest Neighbour Search Using a Single GPU

inferred← citeshttps://doi.org/10.1109/tip.2023.3261755openalex-snapshot

Revisiting Multi-Codebook Quantization

inferred← citeshttps://doi.org/10.1109/tmm.2017.2774009openalex-snapshot

PQTable: Nonexhaustive Fast Search for Product-Quantized Codes Using Hash Tables

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.1111/cgf.14177openalex-snapshot

Optimizing LBVH‐Construction and Hierarchy‐Traversal to accelerate kNN Queries on Point Clouds using the GPU

inferred← citeshttps://doi.org/10.1145/3122865openalex-snapshot

Frontiers of Multimedia Research

inferred← citeshttps://doi.org/10.1145/3219819.3220018openalex-snapshot

Recurrent Binary Embedding for GPU-Enabled Exhaustive Retrieval from Billion-Scale Semantic Vectors

inferred← citeshttps://doi.org/10.1145/3323873.3325018openalex-snapshot

RobustiQ

inferred← citeshttps://doi.org/10.1145/3415958.3433071openalex-snapshot

A Partitioning GPU-based Algorithm for Processing the k Nearest-Neighbor Query

inferred← citeshttps://doi.org/10.1145/3459637.3482344openalex-snapshot

Fast k-NN Graph Construction by GPU based NN-Descent

inferred← citeshttps://doi.org/10.1145/3514221.3517888openalex-snapshot

Scalable Time Series Compound Infrastructure

inferred← citeshttps://doi.org/10.1145/3577193.3593738openalex-snapshot

RT-kNNS Unbound: Using RT Cores to Accelerate Unrestricted Neighbor Search

inferred← citeshttps://doi.org/10.1145/3581784.3607045openalex-snapshot

Co-design Hardware and Algorithm for Vector Search

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/3701716.3715215openalex-snapshot

Creator-Side Recommender System: Challenges, Designs, and Applications

inferred← citeshttps://doi.org/10.1145/3712285.3759801openalex-snapshot

DRIM-ANN: An Approximate Nearest Neighbor Search Engine based on Commercial DRAM-PIMs

inferred← citeshttps://doi.org/10.1145/3716875openalex-snapshot

Accelerating Nearest Neighbor Search in 3D Point Cloud Registration on GPUs

inferred← citeshttps://doi.org/10.1145/3733620.3733629openalex-snapshot

BOSS - An Architecture for Database Kernel Composition

inferred← citeshttps://doi.org/10.14778/3636218.3636239openalex-snapshot

BOSS - An Architecture for Database Kernel Composition

inferred← citeshttps://doi.org/10.14778/3696435.3696439openalex-snapshot

Chameleon: A Heterogeneous and Disaggregated Accelerator System for Retrieval-Augmented Language Models

inferred← citeshttps://doi.org/10.14778/3749646.3749655openalex-snapshot

Fast Graph Vector Search via Hardware Acceleration and Delayed-Synchronization Traversal

inferred← citeshttps://doi.org/10.1609/aaai.v35i1.16118openalex-snapshot

Bringing UMAP Closer to the Speed of Light with GPU Acceleration

inferred← citeshttps://doi.org/10.3169/mta.6.2openalex-snapshot

[Invited Paper] A Survey of Product Quantization

inferred← citeshttps://doi.org/10.3390/electronics8030270openalex-snapshot

Two-Phase PFAC Algorithm for Multiple Patterns Matching on CUDA GPUs

inferred← citeshttps://doi.org/10.3390/info10060190openalex-snapshot

Multi-PQTable for Approximate Nearest-Neighbor Search

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.1806.00365openalex-snapshot

Accurate and Efficient Similarity Search for Large Scale Face Recognition

inferred← citeshttps://doi.org/10.48550/arxiv.2103.15386openalex-snapshot

Large-Scale Approximate k-NN Graph Construction on GPU

inferred← citeshttps://doi.org/10.5753/reic.2019.1707openalex-snapshot

Paralelizacão e Otimizações do Algoritmo de Indexação de Dados Multimídia baseado em Quantização

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.