3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DB2022
DIOT: Detecting Implicit Obstacles from Trajectories
Yifan Lei, Qiang Huang, Mohan Kankanhalli +1
In this paper, we study a new data mining problem of obstacle detection from trajectory data. Intuitively, given two kinds of trajectories, i.e., reference and query trajectories,…
cs.DB2020★ 3 cited
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring
Yifan Lei, Qiang Huang, Mohan Kankanhalli +1
Locality-Sensitive Hashing (LSH) is one of the most popular methods for -Approximate Nearest Neighbor Search (-ANNS) in high-dimensional spaces. In this paper, we propose a n…