Unverified50% confidenceFactExact time
经典光流算法包括基于局部约束的Lucas-Kanade方法和基于全局约束的Horn-Schunck方法，都依赖亮度恒定假设
1
Sources
50%
Confidence
Long-term
Relevance
8/24/2026
First Seen
Sources
Related Entities
Related Claims
Unverified力导向布局的经典实现包括Fruchterman-Reingold算法（1991年）和Kamada-Kawai算法（1989年），朴素实现复杂度为O(n²)每次迭代57% similarUnverified拉格朗日对偶通过引入拉格朗日乘子将约束吸收进目标函数，再利用 KKT 条件转化为对偶问题，引出支持向量和核技巧的理论基础56% similarUnverifiedNguyen and Stehlé proved that as long as the floating-point precision satisfies a dimension-dependent lower bound (approximately O(n) bits of floating-point mantissa precision), the correctness of each step of the LLL algorithm is guaranteed.55% similarUnverifiedIn 1991, Kurt Hornik generalized the universal approximation theorem to almost all nonlinear activation functions.54% similarUnverified辛积分器专为哈密顿系统设计，能精确保持相空间体积（源于刘维尔定理），使长期能量误差有界而非持续累积54% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/794859API
curl https://kongchang.com/api/v1/knowledge/claims/794859MCP
get_claim(id=794859)