As large language models increasingly support long-context inference, the computation and memory access overhead of attention and KV caches have become critical bottlenecks for inference latency and system scalability. Existing approaches mitigate these costs through KV cache dropping, approximate attention, or system-...
Hao-Huan Feng, Shi-Yu Yang, Yuxuan Lu et al.· Proceedings of the 35th ACM...· 0 citations
This work introduces a novel edge-centric framework that treats temporal edges as the core units of exploration and eliminates redundant temporal checks, and extends this framework to dynamic settings by introducing an efficient incremental update algorithm that selectively identifies affected paths only.
Qi Liang, Dian Ouyang, Kang Chen et al.· Proceedings of the 32nd ACM...· 0 citations
Temporal cycles are fundamental patterns in graphs, with important applications in finance, security, and neuroscience. In this work, we study the Simple Temporal Cycle Enumeration (STCE) problem, which aims to enumerate all simple cycles with strictly increasing timestamps within a given time window. However, existing...
Qi Liang, Dian Ouyang, Kang Chen et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
