Search - n2-1 - CodeBus

Search - n2-1 - List

[Software Engineering] Nakatsu DL : 0: Nakatsu算法在计算匹配字符串的情况下，有着良好的时间复杂度O(N(M-P))和空间复杂度O(N2)，而且在采取适当的优化手段时，可以将空间复杂度优化到O(N)，这是一个很诱人的结果。下面将全面介绍Nakatsu算法。-Nakatsu algorithm in calculating matching string case, have a good time complexity O (N (M- P)) and the space complexity is O (N2), and when to take appropriate means of optimization, to optimize the space complexity O (N), it is a very attractive results below will introduce a comprehensive Nakatsu algorithm
Date : 2026-01-08 Size : 14kb User : 李浩
[Software Engineering] 8-optimal_in_FRFTdomains DL : 0: time-invariant degradation models and stationary signals and noise, the classical Fourier domain Wiener filter, which can be implemented in O(N logN) time, gives the minimum mean-square-error estimate of the original undistorted signal. For time-varying degradations and nonstationary processes, however, the optimal linear estimate requires O(N2) time for implementation. We consider filtering in fractional Fourier domains, which enables significant reduction of the error compared with ordinary Fourier domain filtering for certain types of degradation and noise (especially of chirped nature), while requiring only O(N logN) implementation time. Thus, improved performance is achieved at no additional cost. Expressions for the optimal filter functions in fractional domains are derived, and several illustrative examples are given in which significant reduction of the error (by a factor of 50) is obtained.
Date : 2026-01-08 Size : 374kb User : baibai