46 citations · 51 across the 5 of their papers we have counts for
5 papers
Flexible Keyword-Aware Top- Route Search
Ziqiang Yu, Xiaohui Yu, Yueting Chen +3
With the rise of Large Language Models (LLMs), tourists increasingly use it for route planning by entering keywords for attractions, instead of relying on traditional manual map se…
PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search
Bolong Zheng, Xi Zhao, Lianggui Weng +3
Nearest neighbor (NN) search is inherently computationally expensive in high-dimensional spaces due to the curse of dimensionality. As a well-known solution, locality-sensitive has…
TRUST: Triangle Counting Reloaded on GPUs
Santosh Pandey, Zhibin Wang, Sheng Zhong +8
Triangle counting is a building block for a wide range of graph applications. Traditional wisdom suggests that i) hashing is not suitable for triangle counting, ii) edge-centric tr…
REPOSE: Distributed Top-k Trajectory Similarity Search with Local Reference Point Tries
Bolong Zheng, Lianggui Weng, Xi Zhao +3
Trajectory similarity computation is a fundamental component in a variety of real-world applications, such as ridesharing, road planning, and transportation optimization. Recent ad…
SOUP: Spatial-Temporal Demand Forecasting and Competitive Supply
Bolong Zheng, Qi Hu, Lingfeng Ming +4
We consider a setting with an evolving set of requests for transportation from an origin to a destination before a deadline and a set of agents capable of servicing the requests. I…