On the public citation graph

Accelerating Nearest Neighbor Search on Manycore Systems

0 signed · 68 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.1007/11758549_30openalex-snapshot
A Graphics Hardware Accelerated Algorithm for Nearest Neighbor Search
inferredcites →https://doi.org/10.1007/978-1-4613-0131-8openalex-snapshot
Lectures on Analysis on Metric Spaces
inferredcites →https://doi.org/10.1007/pl00009449openalex-snapshot
Nearest Neighbor Queries in Metric Spaces
inferredcites →https://doi.org/10.1016/0167-8655(86)90013-9openalex-snapshot
An algorithm for finding nearest neighbours in (approximately) constant average time
inferredcites →https://doi.org/10.1090/conm/026/737400openalex-snapshot
Extensions of Lipschitz mappings into a Hilbert space
inferredcites →https://doi.org/10.1093/bioinformatics/17.5.419openalex-snapshot
Efficient large-scale sequence comparison by locality-sensitive hashing
inferredcites →https://doi.org/10.1109/cvprw.2008.4563100openalex-snapshot
Fast k nearest neighbor search using GPU
inferredcites →https://doi.org/10.1109/icdm.2010.157openalex-snapshot
SONNET: Efficient Approximate Nearest Neighbor Using Multi-core
inferredcites →https://doi.org/10.1109/mspec.2010.5491011openalex-snapshot
The trouble with multi-core
inferredcites →https://doi.org/10.1109/robot.2010.5509858openalex-snapshot
Using model knowledge for learning inverse dynamics
inferredcites →https://doi.org/10.1109/tpami.2008.128openalex-snapshot
80 Million Tiny Images: A Large Data Set for Nonparametric Object and Scene Recognition
inferredcites →https://doi.org/10.1126/science.290.5500.2319openalex-snapshot
A Global Geometric Framework for Nonlinear Dimensionality Reduction
inferredcites →https://doi.org/10.1126/science.290.5500.2323openalex-snapshot
Nonlinear Dimensionality Reduction by Locally Linear Embedding
inferredcites →https://doi.org/10.1145/1007568.1007594openalex-snapshot
Fast computation of database operations using graphics processors
inferredcites →https://doi.org/10.1145/1143844.1143857openalex-snapshot
Cover trees for nearest neighbor
inferredcites →https://doi.org/10.1145/1198555.1198787openalex-snapshot
Fast computation of database operations using graphics processors
inferredcites →https://doi.org/10.1145/1458082.1458172openalex-snapshot
Modeling LSH for performance tuning
inferredcites →https://doi.org/10.1145/1654059.1654078openalex-snapshot
Implementing sparse matrix-vector multiplication on throughput-oriented processors
inferredcites →https://doi.org/10.1145/1807167.1807206openalex-snapshot
FAST
inferredcites →https://doi.org/10.1145/276698.276876openalex-snapshot
Approximate nearest neighbors
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/502807.502808openalex-snapshot
Searching in metric spaces
inferredcites →https://doi.org/10.1145/509907.510013openalex-snapshot
Finding nearest neighbors in growth-restricted metrics
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/314464.314652openalex-snapshot
An optimal algorithm for approximate nearest neighbor searching
inferredcites →https://doi.org/10.7551/mitpress/4908.003.0005openalex-snapshot
Nearest-Neighbor Searching and Metric Space Dimensions

What points at this work

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

inferred← citeshttps://doi.org/10.1002/sam.11218openalex-snapshot
Dual‐tree fast exact max‐kernel search
inferred← citeshttps://doi.org/10.1007/978-1-4471-4640-7_2openalex-snapshot
Real-Time RGB-D Mapping and 3-D Modeling on the GPU Using the Random Ball Cover
inferred← citeshttps://doi.org/10.1007/978-3-030-15996-2_15openalex-snapshot
Bigger Buffer k-d Trees on Multi-Many-Core Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-43412-9_42openalex-snapshot
cuSLINK: Single-Linkage Agglomerative Clustering on the GPU
inferred← citeshttps://doi.org/10.1007/978-3-319-25087-8_25openalex-snapshot
Brute-Force k-Nearest Neighbors Search on the GPU
inferred← citeshttps://doi.org/10.1007/978-3-642-33418-4_71openalex-snapshot
Real-Time Motion Compensated Patient Positioning and Non-rigid Deformation Estimation Using 4-D Shape Priors
inferred← citeshttps://doi.org/10.1007/978-3-642-40811-3_45openalex-snapshot
3-D Operation Situs Reconstruction with Time-of-Flight Satellite Cameras Using Photogeometric Data Fusion
inferred← citeshttps://doi.org/10.1007/978-981-13-2559-5_5openalex-snapshot
Cluster Indexing and GR Encoding with Similarity Measure for CBIR Applications
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/s11227-017-2110-yopenalex-snapshot
GPU-based exhaustive algorithms processing kNN queries
inferred← citeshttps://doi.org/10.1007/s11227-021-03975-2openalex-snapshot
Fast kNN query processing over a multi-node GPU environment
inferred← citeshttps://doi.org/10.1016/j.future.2021.06.058openalex-snapshot
E-commerce products recognition based on a deep learning architecture: Theory and implementation
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.03.015openalex-snapshot
Parallel multi-dimensional range query processing with R-trees on GPU
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.01.003openalex-snapshot
A novel approach to accelerate calibration process of a k -nearest neighbours classifier using GPU
inferred← citeshttps://doi.org/10.1016/j.jpdc.2018.11.009openalex-snapshot
Large-scale parallel similarity search with Product Quantization for online multimedia services
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.06.003openalex-snapshot
High-dimensional image descriptor matching using highly parallel KD-tree construction and approximate nearest neighbor search
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.jvcir.2016.01.003openalex-snapshot
Indexing and encoding based image feature representation with bin overlapped similarity measure for CBIR applications
inferred← citeshttps://doi.org/10.1016/j.jvcir.2017.01.013openalex-snapshot
Massive parallelization of approximate nearest neighbor search on KD-tree for high-dimensional image descriptor matching
inferred← citeshttps://doi.org/10.1093/mnras/stw2476openalex-snapshot
Sacrificing information for the greater good: how to select photometric bands for optimal accuracy
inferred← citeshttps://doi.org/10.1109/bigdata50022.2020.9378426openalex-snapshot
Approximate Nearest-Neighbour Fields via Massively-Parallel Propagation-Assisted K-D Trees
inferred← citeshttps://doi.org/10.1109/digitalheritage.2013.6743709openalex-snapshot
Improving the digitization of shape and color of 3D artworks in a cluttered environment
inferred← citeshttps://doi.org/10.1109/fpt.2018.00031openalex-snapshot
A Nearest Neighbor Search Engine Using Distance-Based Hashing
inferred← citeshttps://doi.org/10.1109/hpcc.and.euc.2013.140openalex-snapshot
Performance Bottlenecks in Manycore Systems: A Case Study on Large Scale Feature Matching within Image Collections
inferred← citeshttps://doi.org/10.1109/iccvw.2011.6130381openalex-snapshot
Real-time RGB-D mapping and 3-D modeling on the GPU using the random ball cover data structure
inferred← citeshttps://doi.org/10.1109/icip.2013.6738440openalex-snapshot
Real-time acquisition and super-resolution techniques on 3D reconstruction
inferred← citeshttps://doi.org/10.1109/icpp.2013.85openalex-snapshot
Performance Tuning on Multicore Systems for Feature Matching within Image Collections
inferred← citeshttps://doi.org/10.1109/icpp.2016.20openalex-snapshot
Parallel Tree Traversal for Nearest Neighbor Query on the GPU
inferred← citeshttps://doi.org/10.1109/icpp.2016.79openalex-snapshot
PCAF: Scalable, High Precision k-NN Search Using Principal Component Analysis Based Filtering
inferred← citeshttps://doi.org/10.1109/isca59077.2024.00047openalex-snapshot
Tartan: Microarchitecting a Robotic Processor
inferred← citeshttps://doi.org/10.1109/ivcnz.2013.6727017openalex-snapshot
Large-scale feature matching with distributed and heterogeneous computing
inferred← citeshttps://doi.org/10.1109/sccc51225.2020.9281231openalex-snapshot
An exhaustive algorithm based on GPU to process a kNN query
inferred← citeshttps://doi.org/10.1109/tc.2017.2748131openalex-snapshot
Principal Component Analysis Based Filtering for Scalable, High Precision k-NN Search
inferred← citeshttps://doi.org/10.1137/1.9781611972832.1openalex-snapshot
Fast Exact Max-kernel Search
inferred← citeshttps://doi.org/10.1145/2600212.2600710openalex-snapshot
Data filtering for scalable high-dimensional k-NN search on multicore systems
inferred← citeshttps://doi.org/10.1145/2644823openalex-snapshot
Mont’e Scan
inferred← citeshttps://doi.org/10.1145/3178264.3178289openalex-snapshot
Efficient Parallel Processing for KNN Queries
inferred← citeshttps://doi.org/10.1155/2014/829059openalex-snapshot
Accelerating Content-Based Image Retrieval via GPU-Adaptive Index Structure
inferred← citeshttps://doi.org/10.14778/2735461.2735462openalex-snapshot
SRS
inferred← citeshttps://doi.org/10.37099/mtu.dc.etdr/508openalex-snapshot
MASSIVELY PARALLEL ALGORITHMS FOR POINT CLOUD BASED OBJECT RECOGNITION ON HETEROGENEOUS ARCHITECTURE
inferred← citeshttps://doi.org/10.48550/arxiv.1310.4136openalex-snapshot
Scalable Locality-Sensitive Hashing for Similarity Search in High-Dimensional, Large-Scale Multimedia Datasets
inferred← citeshttps://doi.org/10.48550/arxiv.1801.05055openalex-snapshot
Toward Metric Indexes for Incremental Insertion and Querying
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.