4 papers
PreGress: Ranking-Native Pre-training and Prompting for Graph Node Ranking
Lujie Ban, Jiasheng shi, Yingli Zhou +5
Node ranking is a fundamental problem in graph information retrieval, measuring the relative importance of nodes and supporting a wide range of applications such as influence analy…
Efficient Graph Indexing for Interval-Aware Vector Search
Siyuan Liang, Ziqi Yin, Qi Zhang +5
Interval-aware Approximate Nearest Neighbor (ANN) search arises in applications where each object is associated with a numeric value or interval, and queries must satisfy both vect…
MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search
Xiaowei Ye, Rong-Hua Li, Guoren Wang +3
Approximate Nearest Neighbor Search with arbitrary filtering predicates (AFANNS) is essential for modern data applications, yet existing methods often incur substantial storage and…
Preserving Full Degradation Details for Blind Image Super-Resolution
Hongda Liu, Longguang Wang, Ye Zhang +3
The performance of image super-resolution relies heavily on the accuracy of degradation information, especially under blind settings. Due to the absence of true degradation models…