Unverified50% confidenceFactExact time
NMS 计算复杂度与检测框数量的平方成正比，候选框数量多时 CPU 上的 NMS 耗时可能超过模型推理本身
1
Sources
50%
Confidence
Long-term
Relevance
8/19/2026
First Seen
Sources
Related Claims
Unverified精确的 K 近邻搜索（KNN）时间复杂度为 O(n×d)，在数百万级别记忆条目下延迟不可接受，ANN 算法通过牺牲极小精度换取数量级速度提升66% similarUnverified支持向量机的对偶问题通过拉格朗日对偶性转化后，计算复杂度只依赖于样本数而非特征维度，且数据仅以内积形式出现，为核技巧提供理论基础66% similarUnverifiedThe self-attention mechanism resolves the vanishing gradient problem that RNN architectures face when processing long sequences and inherently supports large-scale parallel computation65% similarUnverifiedIncreasing the number of inference passes incurs higher computational costs but in exchange lowers the complexity of each individual task—this is the trade-off of the grouped extraction strategy.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/772317API
curl https://kongchang.com/api/v1/knowledge/claims/772317MCP
get_claim(id=772317)