Publications (7)
Fine-Grained AC Lower Bounds for -OV, -XOR, and -SUM via Colored Subgraph Isomorphism
Haoxing Lin
We prove lower bounds for -OV, -XOR, and -SUM in nonuniform AC, tracking how the circuit-size exponent scales with and using no running-time hypothesis. Our framew…
Preserving Dynamic Attention for Long-Term Spatial-Temporal Prediction
Haoxing Lin, Rufan Bai, Weijia Jia +2
Effective long-term predictions have been increasingly demanded in urban-wise data mining systems. Many practical applications, such as accident prevention and resource pre-allocat…
Interpretable Crowd Flow Prediction with Spatial-Temporal Self-Attention
Haoxing Lin, Weijia Jia, Yongjian You +1
Crowd flow prediction has been increasingly investigated in intelligent urban computing field as a fundamental component of urban management system. The most challenging part of pr…
On Wagner's k-Tree Algorithm Over Integers
Haoxing Lin, Prashant Nalini Vasudevan
The k-Tree algorithm [Wagner 02] is a non-trivial algorithm for the average-case k-SUM problem that has found widespread use in cryptanalysis. Its input consists of k lists, each c…
Mixed Strategies for Security Games with General Defending Requirements
Rufan Bai, Haoxing Lin, Xinyu Yang +3
The Stackelberg security game is played between a defender and an attacker, where the defender needs to allocate a limited amount of resources to multiple targets in order to minim…
Defending against Contagious Attacks on a Network with Resource Reallocation
Rufan Bai, Haoxing Lin, Xinyu Yang +3
In classic network security games, the defender distributes defending resources to the nodes of the network, and the attacker attacks a node, with the objective to maximize the dam…