default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 1,174 matches
- 2025
- Kayumov Abduaziz
, Shincheol Lee
, Ji Sun Shin
:
Enhancing SR-Tree for Nearest Neighbor Search. IEEE Access 13: 63324-63333 (2025) - Seoyoung Ko
, Hyunjeong Shim
, Wanju Doh
, Sungmin Yun
, Jinin So
, Yongsuk Kwon
, Sang-Soo Park, Si-Dong Roh, Minyong Yoon
, Taeksang Song, Jung Ho Ahn
:
Cosmos: A CXL-Based Full In-Memory System for Approximate Nearest Neighbor Search. IEEE Comput. Archit. Lett. 24(1): 173-176 (2025) - Zhen-Pei Shan
, Defu Zhang, Yunqi Lei:
DF-LSH: An efficient Double Filters Locality Sensitive Hashing for approximate nearest neighbor search. Eng. Appl. Artif. Intell. 152: 110742 (2025) - Muhammad Rajabinasab
, Farhad Pakdaman
, Arthur Zimek
, Moncef Gabbouj
:
Randomized PCA forest for approximate k-nearest neighbor search. Expert Syst. Appl. 281: 126254 (2025) - Siyuan Shang
, Xuehui Du, Xiaohan Wang, Aodi Liu:
Private approximate nearest neighbor search for on-chain data based on locality-sensitive hashing. Future Gener. Comput. Syst. 164: 107586 (2025) - Shichao Fang
, Shenda Hong, Qing Li, Pengfei Li, Timothy J. Coats
, Beiji Zou, Guilan Kong
:
Cross-modal similar clinical case retrieval using a modular model based on contrastive learning and k-nearest neighbor search. Int. J. Medical Informatics 193: 105680 (2025) - Chris R. Giannella
:
Instability results for cosine-dissimilarity-based nearest neighbor search on high dimensional Gaussian data. Inf. Process. Lett. 189: 106542 (2025) - Alexander V. Mantzaris
:
LMDiskANN.jl: An Implementation of the Low Memory Disk Approximate Nearest Neighbors Search Algorithm. J. Open Source Softw. 10(110): 8199 (2025) - Alan Araujo, Willian Barreiros
, Jun Kong, Renato Ferreira, George Teodoro:
IMI-GPU: Inverted multi-index for billion-scale approximate nearest neighbor search with GPUs. J. Parallel Distributed Comput. 200: 105066 (2025) - Jianyang Gao, Yutong Gou, Yuexuan Xu, Yongyi Yang, Cheng Long, Raymond Chi-Wing Wong:
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search. Proc. ACM Manag. Data 3(3): 202:1-202:26 (2025) - Yutong Gou
, Jianyang Gao
, Yuexuan Xu
, Cheng Long
:
SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search. Proc. ACM Manag. Data 3(1): 80:1-80:26 (2025) - Mengxu Jiang, Zhi Yang, Fangyuan Zhang, Guanhao Hou, Jieming Shi, Wenchao Zhou, Feifei Li, Sibo Wang:
DIGRA: A Dynamic Graph Indexing for Approximate Nearest Neighbor Search with Range Filter. Proc. ACM Manag. Data 3(3): 148:1-148:26 (2025) - Sairaj Voruganti, M. Tamer Özsu:
MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search. Proc. ACM Manag. Data 3(3): 188:1-188:27 (2025) - Jiuqi Wei
, Xiaodong Lee
, Zhenyu Liao
, Themis Palpanas
, Botao Peng
:
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search. Proc. ACM Manag. Data 3(1): 79:1-79:29 (2025) - Fangyuan Zhang, Mengxu Jiang, Guanhao Hou, Jieming Shi, Hua Fan, Wenchao Zhou, Feifei Li, Sibo Wang:
Efficient Dynamic Indexing for Range Filtered Approximate Nearest Neighbor Search. Proc. ACM Manag. Data 3(3): 152:1-152:26 (2025) - Zhi Xu, Mengdong Zhou, Yuxuan Liu, Longyang Zhao, Jiajia Liu:
Approximate nearest neighbor search by cyclic hierarchical product quantization. Signal Image Video Process. 19(6): 452 (2025) - Mingyang Liu
, Zuyuan Yang
, Wei Han, Shengli Xie
:
Cluster Guided Truncated Hashing for Enhanced Approximate Nearest Neighbor Search. IEEE Signal Process. Lett. 32: 181-185 (2025) - Qiong Chang
, Weimin Wang
, Jun Miyazaki
:
Accelerating Nearest Neighbor Search in 3D Point Cloud Registration on GPUs. ACM Trans. Archit. Code Optim. 22(1): 43:1-43:24 (2025) - Xingyu Gao
, Zhenyu Chen
, Boshen Zhang
, Jianze Wei
:
Deep Learning to Hash With Application to Cross-View Nearest Neighbor Search. IEEE Trans. Circuits Syst. Video Technol. 35(4): 3882-3892 (2025) - Dan Kushnir, Sandeep Silwal:
Cluster Tree for Nearest Neighbor Search. Trans. Mach. Learn. Res. 2025 (2025) - Yifeng Song
, Chenjie Liu
, Rongrong Zhang, Danyang Zhu
, Zhongfeng Wang
:
An Efficient FPGA Implementation of Approximate Nearest Neighbor Search. IEEE Trans. Very Large Scale Integr. Syst. 33(6): 1705-1714 (2025) - Wei Yuan
, Xi Jin
:
FANNS: An FPGA-Based Approximate Nearest-Neighbor Search Accelerator. IEEE Trans. Very Large Scale Integr. Syst. 33(4): 1197-1201 (2025) - Yitong Song, Bin Yao
, Zhida Chen, Xin Yang, Jiong Xie, Feifei Li, Mengshi Chen:
Efficient top-k spatial-range-constrained approximate nearest neighbor search on geo-tagged high-dimensional vectors. VLDB J. 34(1): 14 (2025) - Sarita de Berg, Frank Staals:
Nearest Neighbor Searching in a Dynamic Simple Polygon. SoCG 2025: 37:1-37:15 - Jinxi Yang, He Li, Bo Du, Mang Ye:
Cheb-GR: Rethinking K-nearest Neighbor Search in Re-ranking for Person Re-identification. CVPR 2025: 19261-19270 - Huijun Jin, Jieun Lee, Shengmin Piao, Sangmin Seo, Sein Kwon, Sanghyun Park:
Efficient Approximate Nearest Neighbor Search via Data-Adaptive Parameter Adjustment in Hierarchical Navigable Small Graphs. DATE 2025: 1-7 - Leonardo Delfino, Domenico Erriquez, Silvio Martinico
, Franco Maria Nardini
, Cosimo Rulli
, Rossano Venturini
:
kANNolo: Sweet and Smooth Approximate k-Nearest Neighbors Search. ECIR (4) 2025: 400-406 - Tommaso Teofili
, Jimmy Lin:
Patience in Proximity: A Simple Early Termination Strategy for HNSW Graph Traversal in Approximate k-Nearest Neighbor Search. ECIR (3) 2025: 401-407 - Mingxun Zhou, Elaine Shi, Giulia Fanti:
Pacmann: Efficient Private Approximate Nearest Neighbor Search. ICLR 2025 - Yiwei Li
, Yuxin Jin
, Boyu Tian
, Huanchen Zhang
, Mingyu Gao
:
ANSMET: Approximate Nearest Neighbor Search with Near-Memory Processing and Hybrid Early Termination. ISCA 2025: 1093-1107
skipping 1,144 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-07-18 13:15 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint