computational complexity 中文意思是什麼

computational complexity 解釋
計算復雜性
  1. For the decidable cases of arithmatical sentences, we give the upper and lower bounds of their computational complexity

    對具可決定性的算術句型，我們並給出了其計算繁度的上界與下界。
  2. Fractal coding has been proved useful for image compression. it is also proved effective for content - based image retrieval. in the paper, we present a block - constrained fractal coding scheme and a matching strategy for content - based image retrieval. in this coding scheme, an image is partitioned into non - overlap blocks of a size close to that of a query iconic image. fractal codes are generated for each block independently. in the similarity measure of fractal codes, an improved nona - tree decomposition scheme is adopted to avoid matching the fractal codes globally in order to reduce computational complexity. our experimental results show that our coding scheme and the matching strategy we adopted is useful for image retrieval, and is compared favorably with other two methods tested in terms of storage usage and computing time

    分形編碼在圖像壓縮方面取得了很好的效果，同時，分形編碼也能夠用於基於內容的圖像檢索.本文提出了一種基於塊限制的分形編碼演算法和匹配策略，並將它們用於圖像檢索.在我們編碼演算法中，圖像會被預先分成互相不重疊的子圖像塊，然後對這些子圖像進行獨立地分形編碼，從而獲得整幅圖像的分形碼.該編碼演算法能夠在很大程度上減少編碼時間.在進行圖像間相似性的匹配時，我們採用改進的基於九叉樹的分配策略，從而避免全局地進行分形碼的匹配，減少了計算量.實驗結果說明，我們的編碼演算法和匹配策略能夠比較有效地應用於基於內容的圖像檢索，在計算時間和存儲時間上都優于實驗中其它兩種方法
  3. A good algorithm is one that has a low computational complexity, provides a high quality of motion compensation and also ensures that the bitstream is as small as possible

    一個好的運動估計方法應當是：估計性能高、計算復雜度低、比特傳輸速率低。
  4. Two block time - recursive algorithms are developed for the efficient and fast computation of the 1 - d rdgt coefficients and for the fast reconstruction of the original signal from the coefficients in both the critical sampling case and the oversampling case. the two algorithms are implemented respectively by a unified parallel lattice structure. and the computational complexity analysis and comparison show that the proposed algorithms provide a more efficient and faster method for the computation of the discrete gabor transforms

    首先論證了一維rdgt系數求解演算法和由變換系數重建原信號演算法，不論是在臨界抽樣條件下還是在過抽樣條件下，都同樣具有塊時間遞歸特性，並提出了相應的塊時間遞歸演算法及其并行格型結構實現方法，計算機模擬驗證了并行格型結構實現的可行性，計算復雜性分析與比較也說明了rdgt塊時間遞歸演算法的并行格型結構在計算時間方面所具有的高速和高效性能。
  5. A real - time decoder was used for the characterization test, which is based on a 16 - bit fixed - point dsp. the performance of the dsp solution was demonstrated, including computational complexity and storage characteristics

    在avs音頻標準中核心模塊引入了不同於其他方案的新演算法，本文的第2部分對各部分的演算法原理和特點做了詳細的描述。
  6. Experimental results show that the proposed method can reduce the computational complexity significantly compared with the full search method, and maintain similar decode visual quality and coding bit rate, then improve the ray - space data coding efficiency

    實驗結果表明，與全搜索方法相比，該方法計算復雜度明顯降低，同時保持了近似的解碼圖像質量和編碼碼率，進一步提高光線空間數據的編碼效率。
  7. A problem on the computational complexity of graph partitions

    關于圖劃分中的一個計算復雜性問題
  8. The other classfies the calculation of mbps into the solution of inequation based on heuristic knowledge of mbps of optimal directional coordination setting in complex multiloop network and comes into equivalence of 0 - 1 integral second layout problem. on the basis of the principle of gene optimal evolution, a new approach to determine mbps is first presented and decreases the computational complexity of mbps problem

    其二，利用復雜環網方向保護最優整定配合中最小斷點集（ mbps ）的啟發知識，將mbps的計算歸結為解不等式，進而等價為0 ? 1整數二次規劃問題，基於基因遺傳優化計算原理，首次提出了mbps問題的基因遺傳演算法，降低了問題的計算復雜性。
  9. It is especially attractive for the downlinks and suppressing intercell mai. when multiuser detector is adapted in blind mode, it usually adopts eignvalue decomposition or singularvalue decomposition of received sample correlation matrix and tracking alrithgms, which result in high computational complexity. at the same time, approximation computation in tracking alrithgms also result in slow convergence

    為實現盲自適應檢測，通常採用對接收信號樣本矩陣進行特徵值分解（ evd ）或奇異值分解（ svd ）后進行跟蹤，由此帶來的子空間秩跟蹤使得實現復雜度很高；另一方面，在跟蹤演算法中考慮一些實際情況而作出近似處理，從而引起誤差積累和正交性誤差，導致每次跟蹤開始階段跟蹤速度變慢。
  10. Finally, two upswing algorithms are given, one reduces the computational complexity and improves the resistance capability to the near - far problem, and the other is an adaptive blind mud algorithm with a simple structure

    最後，給出了兩種改進的多用戶檢測演算法，一種降低了運算量，提高了系統抗遠近效應能力；另一種方法是一種簡單結構的自適應盲多用戶檢測演算法。
  11. “ junior researcher : a discover system that can solve the n queens problems ( n ? 4 ) on a constant computational complexity, ” proceedings of fifth jerusalem conference on information technology, israel, 1990

    發現並且總結人類智能活動基本模式之一。 「自動學習知識，並且自動而且有效利用學習到的知識去解決問題的通用能力」的一個基本活動模式。
  12. This standard provides a technical solution for many applications within the information industry such as digital broadcast, high - density laser - digital storage media, and so on. the basic part of avs, avs1 - p2, targets standard definition and high definition format video compression, and aims to achieve similar coding efficiency as h. 264 avc but with lower computational complexity

    Avs1 - p2視頻壓縮標準的制定開始於2002年6月，它主要面向標清和高清視頻的編碼，目標是要取得與h . 264 avc相似的編碼性能，而編碼復雜性要大大低於h . 264 avc 。
  13. The characteristic of h. 264 standard can be concluded mainly into three aspects. it is more practicable, more adaptive to ip net and mobile system and it improves the key components of coding structure based on hybrid video coding framework. for example, it adds coding mode decision, multi frame prediction, context - based adaptive variable length coding ( cavlc ), 4x4 integer transform, loopfilter, etc. the improvement in performance leads to higher computational complexity in the new standard

    H . 264的技術特點可以歸納為三個方面，一是注重實用；二是注重對移動和ip網路的適應；三是在混合編碼器的基本框架下，對其主要關鍵部件都做了重大改進，如多模式運動估計、幀內預測、多幀預測、基於內容的變長編碼、 4 4二維整數變換等。
  14. In the hardware implementation of a multi - channel active noise control system, the computational complexity is increased sharply when the number of filter coefficients and channels are increased

    摘要在多通道有源噪聲控制系統的硬體實現中，當通道數目增大或濾波器長度較長時，常規的多通道演算法運算量急劇增加，使控制器可能無法實時實現。
  15. To solve the tradeoff between congverence and computational complexity, befap is proposed in chapter 3, which is based on block - exact processing and affine projection algorithm. chapter 4 offers hardware and software implementation of the acoustic echo canceller based on tms320vc5409 dsp, which can be applied to a terminal of the tele - conference or video - conference

    為了在收斂速度和運算量之間得到很好的折中，第三章提出了一種基於仿射投影演算法和精確塊技術的快速的自適應演算法（ befap演算法） ，並對該演算法作了詳細的分析和研究。
  16. The experimental results show that these two algorithms are efficient and computational complexity is low. ( 2 ) we prove that necessary and sufficient conditions for bounded and closed ip curves are that second - degree polynomial factor curves in the leading binomial product v abstract decomposed from the leading form of [ p are ellipses

    （ 2 ）證明了隱含多項式曲線封閉有界的條件是隱含多項式分解的首二次因子積中的二次因子曲線是橢圓曲線，並給出了避免隱含多項式曲線自相交的條件。
  17. The new method is a modified pts method, and can make good compromise between performance and computational complexity. the dissertation explores, by means of computer simulation, how the conventional method based on amplitude - limiting and filtering affects the performances of wavelet packet modulation signals, and presents a new method, namely, selective mapping / amplitude limiting / filtering method, which proves to be effective, simple, and have better ber performance

    並基於自子波變換和時間、尺度解析度的概念，從理論和模擬實驗兩方面對通道建模和時間/尺度rake接收機進行了分析，並與傳統的kake接收機進行了比較，結果表明時間/尺度聯合分集能有效地克服高速衰落多徑通道的影響。
  18. First, the mean field method is studied in wdm systems with different dispersion maps. by employing this method the computational complexity is greatly reduced without significant sacrifice of the accuracy of the results

    首先討論了在不同色散管理方案下平均場方法的應用，該方法在不降低模擬精度的情況下大大縮減了所需運算量。
  19. After studying the computation of the adaptive beam - forming algorithms, a modified method with lower computational complexity is put forward. the research tool of the software matlab is used to validate the feasibility of the above related algorithms

    本文主要的研究手段為採用科學和工程計算語言matlab進行模擬實驗，模擬各類智能天線方法的可行性，得出研究的結論。
  20. The simplifications offered by bpm reduce the computational complexity of most problems and speed up the computational process for many

    而tbc邊界條件是假設在接近邊界處的場為一向外輻射的平面波，其幅值、方向等參數由試探法決定。
分享友人
分享到 Line

分享到臉書