Search - graph - CodeBus

Search - graph - List

[Books] GOOD_DFS_BFS DL : 0: 图论中二种遍历图的算法.深度优先遍历,与广度优先遍历.-graph theory two species traverse map algorithm. Depth-first traversal, and the breadth- first traversal.
Date : 2026-01-01 Size : 2kb User : 张新
[Books] praat DL : 0: 语音信号处理软件praat教程：这是一部入门教程，引导您学习Praat——可以分析、合成、变换语音并为论文著述创建优质图表的计算机程序。-Voice signal processing software praat Tutorial: Getting Started This is a tutorial to guide you to learn Praat- can be analyzed, synthesis, voice transformation and graph paper to create quality writing computer programs.
Date : 2026-01-01 Size : 167kb User : 朱建伟
[Books] Afiine_moments_graph_method DL : 0: Affine Invariant moments using Graph method
Date : 2026-01-01 Size : 94kb User : sdqali
[Books] tulunerbanben DL : 0: 图论及其应用（第二版）,清晰的版本哦-Graph Theory and Its Applications (second edition), a clear version of Oh
Date : 2026-01-01 Size : 3.5mb User : kgjk
[Books] tulun_suanfa DL : 0: 本书主要介绍了图论的基本知识，图论的初步方法以及相应的图论程序-This book introduces the basic knowledge of graph theory, graph theory, the initial approach and the corresponding process graph theory
Date : 2026-01-01 Size : 5mb User : quhp
[Books] c DL : 0: Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法-Floyd algorithm is also known as the Floyd algorithm, interpolation method is used to search for a given vertex-weighted graph algorithm shortest path between
Date : 2026-01-01 Size : 1kb User : zyy
[Books] 2 DL : 0: 在无向完全图中寻找边不重复的汉密尔顿回路在无向完全图中寻找边不重复的汉密尔顿回路 -In the absence of complete graph to find the Hamilton side will not repeat loop in the absence of complete graph to find the Hamilton side will not repeat loop in the absence of complete graph to find the Hamilton side will not repeat loop in the absence of complete graph to find the Hamilton side will not repeat the loop
Date : 2026-01-01 Size : 1kb User : xcb
[Books] GraphTheoryIII DL : 0: A very good book on graph theory
Date : 2026-01-01 Size : 2.34mb User : mah
[Books] NetworksCrowdsAndMarkets DL : 0: this E-book is about the graph theory and game theory
Date : 2026-01-01 Size : 12.63mb User : nana
[Books] linkxfrm DL : 0: This graph and datasheet subwof-This is graph and datasheet subwof
Date : 2026-01-01 Size : 52kb User : nguyen dung
[Books] fingerprintmatching DL : 0: 提出一种新的指纹匹配算法.在配准阶段,引入局部方向场匹配,并结合局部细节点拓扑结构匹配以进行指纹对齐在对齐后的匹配中,首先在两个指纹的细节点集之间进行弹性匹配,得到一个由匹配的细节点对组成的相集,然后以相似集中的细节点做顶点,以各顶点之间的连线为边,为输入指纹和模板指纹组对应的拓扑图进行图匹配还引入了全局方向场匹配,并与细节点集匹配进行融合,以提高算法的精度.采用FVC2002公布的指纹库进行对比实验,结果证明了算法的有效性.-A new fingerprint matching algorithm. In the registration phase, the introduction of local orientation field matching, combined with the topology of local minutiae matching for fingerprint alignment in alignment after the match, the first two fingerprint minutiae elastic matching between sets, get the details of a matching set of points on the phase composition, and then focus on the details of the points made similar peak to the connection between the vertices for the edge of the input fingerprint and template fingerprint groups corresponding graphs, graph matching also introduces the global orientation field matching, point set match with the details of the fusion to improve the algorithm accuracy. FVC2002 published fingerprint database using comparative experiment results demonstrate the effectiveness of the algorithm.
Date : 2026-01-01 Size : 326kb User : 李辉艳
[Books] main DL : 0: 求最大度问题，数据结构与算法。-Given a graph which contain N (1 <= N<= 2,500) nodes numbered from 1 to N. This graph has some edges, suppose the graph contain C (1 <= C <= 6,200) edges (described as two nodes ni1 and ni2 (1 <= ni1 <= N 1 <= ni2 <= N)). Now could you tell me which node has the max degree (For each node, the degree is the number of edges connects to the node.)? Output the max degree please.
Date : 2026-01-01 Size : 71kb User : team
[Books] branch-and-bound-method DL : 0: 介绍分支限界法的思想，解空间树的搜索，算法的时间性能，图问题中的分支限界法，多段图的最短路径问题等-The idea of the introductory branch and bound method, the search of solution space tree, the time performance of the algorithm, graph problems in the branch and bound method, Multistage Graph shortest path problem
Date : 2026-01-01 Size : 84kb User : 乔艳梅
[Books] Bang-Jensen_Gutin_Digraphs DL : 0: 图论算法权威指南。目前为止唯一一本有向图方面最好的一本综述。英文算法学习资料。-Graph theory algorithm Definitive Guide. So far only a Summary of the one of the best directed graph. English algorithm learning materials.
Date : 2026-01-01 Size : 3.38mb User : rock
[Books] graph-mining-laws-generators DL : 0: 网络挖掘，该文详细描述了网络挖掘的研究现状，相关方法-Network mining, this paper detailed description of the current network mining research and related methods
Date : 2026-01-01 Size : 693kb User : niu
[Books] 2009-2010 DL : 0: 应用图割的方法来变化检测，提高检测精度，去噪效果明显。-Change detection application graph cuts to improve the detection accuracy
Date : 2026-01-01 Size : 2.28mb User : 古丽
[Books] VB_Qu_xian_tu DL : 0: VB生成曲线图, VB生成曲线图-VB generate graphs, VB generated graph, VB generates the graph
Date : 2026-01-01 Size : 4kb User : lwm
[Books] z2zkm DL : 0: 《站站通之百度关键字排名查询记录系统》能准确的记录多个关键字及多个域名在百度查询结果里的排名，还能把这些排名用曲线图表示出来。是你监控seo效果及考核seoer的良好工具-" Station through the Baidu keyword ranking query system of record" can accurately record multiple keywords and multiple domains in Baidu query result ranking, but also to use these rankings graph represented. Monitoring the effect of your seo tools and assessment seoer good
Date : 2026-01-01 Size : 473kb User : xixixi700201
[Books] A-Graph-Theoretic-Approach-to-Scheduling-in-Cogni DL : 0: Graph Theory in Cognitive Radio Networks
Date : 2026-01-01 Size : 181kb User : Harish
[Books] Graph-based-Criteria-for-Spectrum-Aware-Clusterin DL : 0: Graph Theory in cognitive Radio networks
Date : 2026-01-01 Size : 1.53mb User : Harish

« 12 »