The complexity analysis of the fixed window algorithm and the optimal length of window are also discussed.
最后给出了固定窗口算法的复杂性分析,并讨论了窗口宽度的最佳选取。
Additionally the algorithm has the optimal time and space complexity.
此外,这种算法具有最优的时间和空间复杂性。
Therefore, there is no algorithm with polynomial computational complexity that guarantees optimal motion vectors.
因此,没有一个多项式(计算的复杂性)算法可以保证最优运动向量。
应用推荐