p (complexity) 中文意思是什麼

p (complexity) 解釋
p （度）
  • p :
  • complexity : n. 1. 復雜性，復合狀態。2. 復合物；復雜的事物[情況]。
  1. 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 ）證明了隱含多項式曲線封閉有界的條件是隱含多項式分解的首二次因子積中的二次因子曲線是橢圓曲線，並給出了避免隱含多項式曲線自相交的條件。
  2. 3. a fast algorithm is proposed for computing the linear complexity of a binary sequence with period p ? and generalized one for determining the linear complexity of a sequence with period pfl over gf ( q )

    提出了一個計算周期為p ~ n的二元序列的線性復雜度的快速演算法，並推廣為確定gf （ q ）上周期為p ~ n的序列線性復雜度的快速演算法。
  3. And the retrieval algorithms of mismatched macroblock for dct - domain requantization trancoder are introduced in the chapter. many simulation results testified that the motion - compensation only for p - pictures transcoding solution is a better compromise between the complexity and video quality

    大量模擬結果證實，本文提出的省略b幀運動補償轉碼器是視頻質量和運算復雜度的一種較好的折衷演算法。
  4. In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object

    同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度，該演算法可以減少光錐向圖像平面投影計算的次數，以邊池搜索取代散亂點集上進行的三角剖分； （ 2 ）基於退化多邊形求交的多面體可見殼模型重構，系統引入退化多邊形的概念，把錐體平面的交集中不連通的部分用一個退化多邊形來表示，並引入了新的基於退化多邊形的求交演算法，與傳統多面體可見殼重構相比，該演算法有以下幾點創新：在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集，把任意錐面與物體輪廓的交集歸一到一個退化多邊形；基於退化多邊形的二維平面上多邊形快速相交演算法，該演算法在一定程度上就是兩個有序鏈表的合併，大大簡化了先前的布爾求交計算； （ 3 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  5. Image and vision computing, 1999, 17 : 489 - 499. 4 gottschalk p g, turney j l, mudge t n. efficient recognition of partially visible objects using a logarithmic complexity matching technique. the international journal of robotics research, 1999, 8 : 110 - 131

    它從以下幾方面解決以上問題：第一，高尺度的分析突出了圖像的高頻部分，因此能夠更準確地匹配圖像特徵第二，利用非均勻有理b樣條表示圖像畸變，這對大多數現實的圖像幾何畸變都適用。
  6. 1 sasao t, besslich p. on the complexity of mod - 2 sum pla s

    然而，這一方法不適合於大函數mprm的優化。
  7. 5. a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period 2pfl over gf ( q ) is proposed, and a new algorithm for determining the linear complexity of a sequence with period pfl over gf ( p ? ) is introduced

    提出一個計算gf （ q ）上周期為2p ~ n序列的線性復雜度和極小多項式的快速演算法；提出一個計算gf （ p ~ m ）上周期為p ~ n的序列的線性復雜度的新演算法。
分享友人
分享到 Line

分享到臉書