partitioning algorithm 中文意思是什麼
-
Based on all these above, the results of main research are as follows : ( 1 ) a voice activity detection ( vad ) algorithm based on dct band - partitioning spectral entropy is proposed
本文以此為基礎，並取得了如下研究成果: （ 1 ）提出了基於dct分帶譜熵的語音檢測演算法。 -
An approximation algorithm for min - max tree partitioning and an optimal algorithm for min - sum tree partitioning
最小最大樹劃分的近似演算法與最小和樹劃分的精確演算法 -
Finally, the error images of mp are coded by spiht ( set partitioning in hierarchical trees ) to get the final codestream. in order to testify the effectiveness of the proposed algorithm, aviris images are used for computer simulation and the results indicate the proposed
最後，對經過mp演算法處理后的殘差圖像利用spiht （ setpartitioninginhierarchicaltrees ）演算法進行編碼，從而完成了對高光譜圖像的壓縮。 -
In this paper, we propose the chord - distribution - based image description, and research the image retrieval algorithm based on this description. the main work of the paper consists of two part that are the feature description about image and the algorithm of image retrieval. in the first part, we propose the definition of region - chord, the presentation of chord - distribution, and describle image after analyzing the properties of chord - distribution. in the second part, after partitioning image and counting region - chord - distribution, we analyse the forground and background of image to each region and propose the criterion of the similarity of images
論文的主要工作由圖象特徵描述和圖象檢索演算法兩部分組成。在圖象特徵描述部分，我們給出了區域弦的定義和區域弦分佈的表示，分析了弦分佈的性質，並在此基礎上進行了圖象特徵描述。在圖象檢索演算法部分，本文首先作了圖象區域劃分、區域弦分佈的計算；其次對區域作了前景、背景分析並給出了圖象間的相似性度量。 -
Secondly, we utilize fault sensitization mode partitioning to develop a search - space parallel tg algorithm
然後，提出了一個新的基於故障敏化模式分解的搜索空間并行tg演算法。 -
Then, a linear - time partitioning algorithm based on a linear ordering of nodes in a circuit for parallel logic simulation is presented
然後，提出一種在對電路中節點進行線性排序的基礎上的線性時間劃分演算法。 -
A data - partitioning - based nearest - neighbors - first clustering algorithm
基於數學形態學的圍棋棋群聚類演算法 -
So we present two methods : the mod method by introducing mismatched control vector and the ssp algorithm by partitioning subspaces to reduce the dimensions of adaptive process
為此，我們提出了兩種方法:通過引入失配方向控制向量而得到的最優失配檢測方法和通過子空間劃分而減小自適應維數而得到的子空間投影方法。 -
The paper analyses the complex terrain model ’ s real time and dynamic simplifying and multi - resolution display. this dissertation combines the technology of world - space partitioning 、 real - time rending and an improved roam algorithm to solve too many triangles rendering problem in large - scale terrain environment
研究了復雜地形模型的實時動態簡化與多解析度表示，運用一種將場景分割技術、實時渲染相關技術和優化的roam演算法相結合的大規模地形渲染方法來解決三角形數目大的問題。 -
In this method the relationships between visual point and scene space are analyzed for pixel space identification to avoid the blindness of task partitioning, the load balance is guaranteed by using nsota approximate algorithm
該方法通過分析視點與場景空間的關系，進行像素空間的劃分，避免并行處理任務分配的盲目性；採用近似的nsota演算法保證了任務分配的均衡性。 -
Recurring to resynchronization marker, data partitioning and rvlc, video files with errors are dealt with. the article codes and decodes video source files with errors, computing every algorithm ' s psnr, comparing video pictures " subjective and objective quality
運用重同步標志（ resyncmarker ） 、數據分離（ datapartitioning ）和可逆變長編碼（ rvlc ）對含錯的視頻文件分別做錯誤處理。以mpeg - 4錯誤恢復方法對糟糕視頻源文件編碼、解碼，計算該演算法的psnr ，比較視頻幀的主客觀質量。 -
Firstly, the size of the graph is reduced by collapsing vertices and edges. then, each smaller graph is divided into a certain number of subdomains by means of initial partitioning algorithm. finally, these subdomains are refined back to the original graph through mapping and multi - partitioning refinement strategy
首先通過圖的頂點和邊的收縮將圖逐層縮小，然後在小圖上用初始分區演算法將它劃分為給定數目的子區，最後利用映射和多分區調整策略將小圖上的分區細化回歸到原始圖。 -
As emphasis, we propose a new backward width - flrst search circuit partitioning method with flip - flop as core for synchronous sequential circuits. and then based on it, we develop a new circuit parallel tg algorithm
最後重點對電路并行方法進行了研究，提出了一種新的以觸發器為核且消除大功能塊之間反饋的寬度優先反向搜索同步時序電路劃分方法。 -
The data spatial cell partitioning and data object allocating methods based on the problem of boundary outlier misjudgment in cell outlier mining algorithms are discussed. then a dynamic adjustment function on dataset boundary threshold is defined and an improved algorithm on the cell - based outlier is brought forward. it can greatly reduce the amount of misjudgment on boundary outlier by the algorithm discussed in this paper without increasing the complexity and the calculating time of the original algorithm
針對演算法中邊界處孤立點的誤判問題，給出了數據空間的單元格劃分及數據對象分配方法，定義了數據集邊界閾值動態調整函數，提出了基於單元的孤立點挖掘演算法的改進演算法，在不增加原有演算法時間復雜度的前提下，極大地減少了邊界處孤立點的誤判。 -
In this thesis, grid partitioning is converted to an unoriented and weighted graph, on which partitioning algorithm is studied
本文將網格分區問題轉化為無向賦權圖的分區，在圖上研究分區演算法。 -
Area partitioning algorithm of boolean operations on highly complicated 2d polygons
海量數據多邊形布爾運算的區域分割演算法 -
Unlike most other partitioning algorithms, the proposed algorithm preserves circuit concurrency by balancing the workload on processors at real time
本文提出的演算法很好的解決了這個問題，保證了模擬過程中各個處理器上的實時負載平衡，實現了高度的并行性。 -
In order to further reduce the complexity of super large - scale integration design and enhance graphical readability, a hybrid genetic algorithm for solving circuit partitioning problem was presented
摘要為了進一步降低超大型規模集成電路設計的復雜性、增強圖形可讀性，提出了一種求解電路劃分問題的混合式遺傳演算法。 -
Abstract : the parallel computer ' s resource can be used efficiently by proper task partitioning and parallel granularity controlling. by analyzing the characteristic of simulation program, this paper points out a task partitioning algorithm which take state equations as core and right - hand function as object. the algorithm has been used in the automatic parallel tools which we have developed and the application results have showed good effect on parallel simulation
文摘:有效地進行任務劃分、控制并行粒度，才能充分利用并行計算機的資源，通過對復雜連續系統模擬程序特點的分析，提出了以狀態方程為核心、以右函數段的計算為主要對象的自動任務劃分演算法，使用結果表明具有很好的并行效果。 -
Abstract : an efficient partitioning algorithm for mixed - mode placement, extended - mffc - based partitioning, is presented. it combines the bottom - up clustering and the top - down partitioning together. to do this, designers can not only cluster cells considering logic dependency but also partition them aiming at min - cut. experimental results show that extended - mffc - based partitioning performs well in mixed - mode placement with big pre - designed blocks. by comparison with the famous partitioning package hmetis, this partitioning proves its remarkable function in mixed - mode placement
文摘:提出一種專用於帶有預設計模塊的混合模式布局的劃分演算法.它基於擴展的mffc結群演算法，結合自下而上的結群和自上而下的劃分為一體進行混和模式下的劃分.這樣不僅可以使劃分能夠考慮電路本身的邏輯依賴，而且可以得到很好的"最小割"劃分結果.實驗結果表明，這種劃分演算法在層次式混合模式布局流程里起到了顯著的作用.將此演算法和當今國際上著名的劃分包hmetis進行比較，結果表明此演算法有一定的優勢
分享友人