acyclic graph 中文意思是什麼

acyclic graph 解釋
非循環圖
  • acyclic : adj. 非周期性的；【化學】非環式的；【植物；植物學】非輪生的。
  • graph : n. 1. 【數學】曲線圖；坐標圖，圖表。2. 統計曲線。vt. 用圖表表示，把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
  1. G is a maximal acyclic graph.

    G是一個極大無圈圖。
  2. G is a maximal acyclic graph

    G是一個極大無圈圖。
  3. Directed acyclic graph

    有向無環圖
  4. The dependency structure between packages must be a directed acyclic graph ( dag ). that is, there must be no cycles in the dependency structure

    包之間的依賴結構必須是一個直接的無環圖形（ dag ） 。也就是說，在依賴結構中不允許出現環（循環依賴） 。
  5. By directed acyclic graph model, video server can select correct substreams by network bandwidth and terminal capability to get any frame rate, spatial resolution but coarse granular scalability presentation of video

    通過該模型，視頻流媒體服務器能夠根據網路帶寬，終端能力，正確地選擇子碼流進行傳輸播放。
  6. A file format is proposed based on the generic model and iso base media file format. we first create a directed acyclic graph model to describe the substreams and relationships among those substreams in a scalable video stream

    本文首先建立了一個有向無環圖模型，該模型能夠描述可擴展視頻編碼碼流中各子碼流和子碼流間復雜的依賴關系。
  7. Based on the available resources mapping algorithm using the directed acyclic graph, a new dynamic resource co - allocation algorithm is proposed to solve the dynamic problem of the resource co - allocation in the grid

    摘要針對網格系統中資源協同分配的動態性問題，分析了現有的基於有向無環圖的資源映射方法，提出了一種動態資源協同分配演算法。
  8. Second, an adaptive rate - distortion model is proposed by extending directed acyclic graph model for fine granular scalable video coding. we add rate, original distortion and adaptive scale to the directed acyclic graph model

    其次，針對精細粒度可擴展視頻編碼技術，本文擴展有向無環圖模型，在該模型中加入碼率，原始失真和自適應因子等屬性，建立了自適應率失真模型。
  9. In the proposed algorithm, each application is represented by a directed acyclic graph, and then all directed acyclic graphs are partitioned into several levels, during executing process, the ready application set can insert in term of a certain regular

    該演算法採用有向無環圖表示每個應用，然後，將所有這些圖進行分層，執行過程中，就緒的應用組可以按照一定的規則動態插入。
  10. The support vector machine composed by least sequence and directed acyclic graph algorithm has been used in paper currency identification, shows the advantages of capability in dealing with scared samples, nonlinear and high dimensions

    將次序最小優化改進演算法和有向無環圖演算法構建的支持向量機用於貨幣識別，充分發抨了支持向量機解決小樣本、非線性和高維模式識別問題的優點。
  11. Of xml nodes ; a grove is a collection of trees in computer science terms, a directed acyclic graph, and xslt is an example of a host language for xpath that takes advantage of this distinction to allow xpath to process the contents of multiple source documents courtesy of the xslt

    ，林是樹（在計算機科學中指的是有向無環圖）的集合， xslt是一種xpath宿主語言，它利用了這一差別來允許xpath處理多個源文檔的內容（得益於xslt函數
  12. The compare is made between the one - versus - one, one - versus - rest and directed acyclic graph algorithm of presented support vector machine multi - class classification algorithms. the simulations show the advantage of directed acyclic graph algorithm over the others the identification rate

    分析比較了現有支持向量機多值分類演算法中的一對一、一對多和有向無環圖演算法，分析表明有向無環圖相對于其它兩種演算法，不僅速度快，而且識別率也較高。
  13. In this paper, we use directed - acyclic graph ( dag ) to represent a query processing, then define a cost model and a query efficiency model, and finally put forward an algorithm for materialized views selection

    在考慮空間約束的基礎上，提出一種物化視圖選擇方法，並給出了切實可行的演算法步驟。
  14. Among them the applications with the general local lemma arc the most important, such as acyclic edge colorings of graphs. we prove that the acyclic edge chromatic number of g is less than or equal to a + 2 for any graph g whose girth is at least 700 log

    ） sz局部引理給出應用實例，即無圈邊染色，證明了當圖g的圍長大於等於700 log時，圖g的無圈邊色教小於等於+ 2然後，用概率論的方法證明了幾種形式的lov （
  15. A belief network is a probability model defined on an acyclic directed graph ; distributed means nodes can be on different hosts, and heterogeneous means allowing different conditional distributions

    一個信念網路是定義在一個非循環有向圖上的概率模型；分佈性指節點可以在不同的主機上，異質性指可以允許不同的條件分佈。
  16. We prove that halin graphs, 1 - trees and outerplanar graphs satisfy the conjecture presented by n. alon that the acyclic edge chromatic number of any graph does not exceed its maximum degree plus 2

    證明了halin圖、 1 -樹和外平面圖滿足由n . alon提出的任何一個圖的無圈邊色數不超過其最大度加2的猜想。
  17. Bn is a directed acyclic graph with network structure, which is intuitionistic and easy understanding. it can handle multi - information expression, data fusion and bi - directional parallel reasoning. the ability to colligate the prior information and the current information makes the inference much more accurate and believable

    貝葉斯網路是一種基於網路結構的有向圖解描述，具有多源信息一致表達與信息融合能力，能進行雙向并行推理，並能綜合先驗信息和樣本信息，使推理結果更為準確可信。
分享友人
分享到 Line

分享到臉書