Skip to content

Author

Rong-Hua Li

6 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Book Open access Nov 2026

FortMem: Secure Stateful Data Management for Long-Term LLM Agent Memory

Long-term LLM agent memory has become a critical state layer where records are written once and reused across sessions, turning prompt poisoning from a one-shot hazard into persistent database corruption. Traditional stateless RAG defenses reset per query and fail to evaluate the trustworthiness of persistent records o...

Ze-Ning Li, Hong-Chao Qin, Guang Zeng et al. · 0 citations
Book Open access Nov 2026

ID2GL: Incremental Node Representation Learning on Large-Scale Dynamic Directed Graphs

Node representation learning on dynamic graphs is a fundamental task for numerous real-world applications. However, existing dynamic Graph Neural Networks (GNNs) face two critical challenges: (1) the inability to effectively model crucial directional information inherent in many real-world interactions, and (2) suffer...

Ze-Ning Li, Rong-Hua Li, Yi-Chun Yang et al. · 0 citations
Preprint Oct 2026

Geo-Filtered Approximate Nearest-Neighbor Search on a Single Proximity Graph

Geo-filtered approximate nearest-neighbor (GFANN) search retrieves the objects inside a query-specified geographic disk whose feature vectors are closest to a query vector, a core operation in location-aware Web search. A disk filter on a standard proximity graph invalidates out-of-disk routing vertices; on selective d...

Zhi-Qiu Zou, Rong-Hua Li, Qiang-Qiang Dai et al. · 0 citations
Book Open access Nov 2026

MemDTG: Dynamic Temporal Memory Graphs for Evidence-Admissible Agent Memory

Long-term agent memory is an online, non-monotonic retrieval problem. New interactions may reinforce, contradict, supersede, specialize, abstract, or expire earlier memories; the same fact can be a wrong current answer, a correct historical answer, or necessary transition evidence depending on query intent. Existing ch...

Ya-Xin Deng, Hong-Chao Qin, Tian-Yi Gao et al. · 0 citations
Open access Sep 2026

Tree+DAG: An Efficient Index for Resistance Distance Computation on Core-Periphery Graphs

Resistance distance computation is a fundamental problem in graph data management. To avoid the high latency of online evaluation, recent work builds offline indexes. Existing approaches, however, fall into two families with complementary weaknesses: loop-erased random-walk methods (e.g., LEIndex) are efficient on fa...

Mei-Hao Liao, Bao Xing, Rong-Hua Li et al. · 0 citations
Open access Sep 2026

Scaling Up Density Decomposition on Massive Graphs

Density decomposition characterizes the multi-level dense structure of large networks and supports a wide range of graph mining applications. Given a graph G = (V, E) , it assigns each vertex an integral dense number (IDN) and produces a nested sequence of layers D 0 ⊇ D 1 ⊇ ... ⊇ D p that capture increasingl...

Ya-Long Zhang, Rong-Hua Li, Qi Zhang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.