Welcome![Sign In][Sign Up]
Location:
Search - GM Science

Search list

[OtherGM

Description: GM Science GM模型 全称:灰色理论的微分方程型模型 灰色理论的微分方程型模型称为GM模型,G表示grey(灰),M表示Model(模型).GM(1,N)表示1阶的,N个变量的微分方程型模型.而GM(1,1)则是1阶的, 1个变量的微分方程型模型。-GM Science GM model name: the theory of differential equations gray gray theory-based model of the differential equation-based model known as the GM model, G said grey (gray), M said the Model (model). GM (1, N), said a band, N-type model of a variable differential equations. The GM (1,1) is an order, and a variable differential equation-based model.
Platform: | Size: 1024 | Author: | Hits:

[OtherAVL_tree

Description: 在计算机科学中,AVL树是最先发明的自平衡二叉查找树。AVL树得名于它的发明者 G.M. Adelson-Velsky 和 E.M. Landis,他们在 1962 年的论文 "An algorithm for the organization of information" 中发表了它。 -In computer science, AVL tree is a self-balancing binary search tree first invented. AVL tree is named after its inventor GM Adelson-Velsky and EM Landis, they published a paper in 1962 that it " An algorithm for the organization of information" in.
Platform: | Size: 8192 | Author: wlx | Hits:

[Special Effectsfgm_2012_05_12

Description: 分解图匹配(Factorized Graph Matching)源码-Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix (2) The factorization allows the use of a path-following optimization algorithm
Platform: | Size: 7779328 | Author: GuoWei | Hits:

CodeBus www.codebus.net