2 citations · 3 across the 10 of their papers we have counts for
Showing cs.DBShow all
3 papers · 1 filter
cs.DB2026
U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics
Huayi Wang, Jingfan Meng, Jun Xu
Approximate nearest neighbor search under universal L_p metrics (ANNS-U-L_p) is an important and challenging research problem, as it requires answering queries under all possible p…
cs.DB2023★ 2 cited
Rethinking Similarity Search: Embracing Smarter Mechanisms over Smarter Data
Renzhi Wu, Jingfan Meng, Jie Jeff Xu +2
In this vision paper, we propose a shift in perspective for improving the effectiveness of similarity search. Rather than focusing solely on enhancing the data quality, particularl…
cs.DB2021★ 1 cited
MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS in Distance
Huayi Wang, Jingfan Meng, Long Gong +2
Approximate Nearest Neighbor Search (ANNS) is a fundamental algorithmic problem, with numerous applications in many areas of computer science. Locality-sensitive hashing (LSH) is o…