1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DB2022
Efficient Reachability Ratio Computation for 2-hop Labeling Scheme
Junfeng Zhou, Xian Tang, Ming Du
As one of the fundamental graph operations, reachability queries processing has been extensively studied during the past decades. Many approaches followed the line of designing 2-h…
cs.DB2021★ 1 cited
Tao: A Learning Framework for Adaptive Nearest Neighbor Search using Static Features Only
Kaixiang Yang, Hongya Wang, Bo Xu +4
Approximate nearest neighbor (ANN) search is a fundamental problem in areas such as data management,information retrieval and machine learning. Recently, Li et al. proposed a learn…