Unverified50% confidenceFactExact time
The project efficiently computes the history vector P_t via zero-padded FFT linear convolution, keeping overall complexity at O(T log T).
1
Sources
50%
Confidence
Long-term
Relevance
9/11/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe project feeds a deterministic, normalized inverse-lag history vector P_t into the recurrent unit, weighted by harmonic numbers, causing historical information to decay at a rate of 1/k.70% similarUnverifiedThe time complexity of the Leiden algorithm is approximately linear (O(n log n)), which gives it good scalability in engineering applications.63% similarUnverified传统线性时不变SSM（如S4模型）系统矩阵A、B、C在序列处理中保持不变，递推关系可展开为卷积形式，利用FFT在O(N log N)时间内并行计算61% similarUnverified在二分类问题中召回率（Recall/Sensitivity）计算公式为TP/(TP+FN)，衡量模型识别所有真实阳性样本的能力60% similarUnverified对于超大规模图谱，基于 Barnes-Hut 算法可实现 O(N log N) 近似力计算以优化性能59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/902246API
curl https://kongchang.com/api/v1/knowledge/claims/902246MCP
get_claim(id=902246)