搜索资源列表
pidbaseondsp
- 编写基于DSP的PID汇编子程序，基于CC4.0的软件仿真器Simulator调试程序，并用CC4.0的Graph功能观测PID控制器的输出波形。-prepared DSP-based PID compilation subroutine, Based on the CC4.0 Simulator Simulator software debugging procedures, CC4.0 using the Graph function observation PID controller o
图挖掘
- The SUBDUE graph-based pattern learning system finds relational patterns in data represented as a graph. While the details of how SUBDUE works internally will not be discussed here (you can refer to other documents on the SUBDUE web-site for more inf
最短路径导游的程序
- 校园导游咨询：编制一个为来访客人进行最短路径导游的程序从厦门大学漳州校区的平面图中选取10个有代表性的景点，抽象成一个无向带权图。以图中顶点表示景点，边上的权值表示两地之间的距离。 2.本程序的目的是为用户提供路径咨询。根据用户指定的始点和终点输出相应路径，或者根据用户指定的景点输出景点的信息。--Campus Tour consulting: the preparation of a shortest path for visiting guests to the program guide
random_walker_matlab_code
- The random walker algorithm was introduced in the paper: Leo Grady and Gareth Funka-Lea, "Multi-Label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials", in Proceedings of the 8th ECCV04, Workshop on Compute
src
- 单词还原工具，自顶向下的分析 器和基于图的自底向上句法分析器。重点是基于图的自底向上句法分析器(chart parser)。-The word Restore tool, top-down parser, and graph-based bottom-up parser. Focused on graph-based bottom-up parser (chart parser).
C
- 主要介绍线性结构,树型结构,图状结构三种逻辑结构元素的存储实现,在此基础上介绍一些典型算法及时,空效率分析.-Introduces the linear structure, tree structure, graph-like structure of three elements of the logical structure of the storage to achieve, on this basis are some typical algorithms in time, spac
TDICCD
- 】手掌可以用于疾病诊断．掌纹线所组成的不同形状(结构)在疾病诊断中占有极其重要的地位， 准确识别这些掌纹线的不同结构，对于提高自动掌纹诊病系统的正确率有非常重要的意义．要进行有效的掌纹线 结构识别，首先必须将掌纹线结构准确地表示出来．本文提：B一种基于无向图的掌纹线结构表示方法，实验结果 表明该方法可以较为完整地表示出掌纹线的结构，这为进一步进行自动掌纹诊病研究打下了必要的基础．-】 Palm can be used for disease diagnosis. Palmprint
xyl_suanfa
- 匈牙利算法是基于Hall定理中充分性证明的思想，它是部图匹配最常见的算法，该算法的核心就是寻找增广路径，它是一种用增广路径求二分图最大匹配的算法。-Hungarian algorithm is based on the thought of the Hall theorem sufficient proof, it is the Ministry of graph matching most common algorithm, the core of the algorithm is to fi
school-map
- 从厦门大学的平面图中选择11个有代表性的景点，抽象成一个无向带权图，以图中顶点表示景点，边上权值表示两地距离。 本程序目的是为用户提供路径咨询，根据用户指定的始点和终点输出相应路径，或者根据用户指定的景点输出景点信息。-11 representative attractions from a plan view of the Xiamen University, abstracted into a no attractions to vertices in the graph indicat
adjacency-list
- 基于邻接表表示的图的遍历包括深度优先遍历和广度优先遍历-Based on the adjacency list representation of the graph traversal, including the depth-first and breadth-first traversal
graphpartition
- MATLAB function to partition very large graphs very fast. This function implements a graph partitioning algorithm based on spectral factorization. This algorithm is described in the following technical report: Joã o Hespanha. An efficient MA
tizhongshengao
- 该软件可以实现对男生和女生身高和体重的录入，然后根据历史数据可以实现对身高和体重的预测并绘制出曲线图，而且可以实现曲线图的保存。-The software can be achieved on the height and weight of boys and girls of entry, then you can achieve the height and weight of forecasts based on historical data and draw graphs, and c
graph
- 基于图论的应用，简单的实现及其功能，以及利用图论解决商人问题-Based on the application of graph theory, a simple realization and function, and the use of graph theory to solve the problem of businessman
LearningProcessing-master
- processing graph based programming
tuge-v
- 这个是基于图论的分割算法，是根据一篇sic编的，效果值得信赖-This is a compilation of matlab m file with the graph cut algorithm is based on a paper series, the effect trustworthy
image-denoising
- Abstract—Single image denoising suffers limited data collection within a noisy image. In this paper, we propose a novel image denoising scheme, which explores both internal and external correlations with the help of web images. For each noisy
netflix.m
- collaborative filtering code MathLabs for the recommended system, including item-based and user-based two cases. User-based and item-based collaborative filtering algorithm. Experimental data for MovieLens- a web-based movies recommender system with
myMatlab-code
- In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. This algorithm is a member of the
ypea104-acor
- continuous ACO. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. This algorithm
EE5731R-GBVS-master
- 基于图的显著性检测方法(graph based image saliency)