搜索资源列表
WS小世界网络MATLAB
- % The simulation of WS-smallworld network % the algorithm of WS-smallworld's generation has been improved in speed, % and tend to be easily understood % writen by winter-my-dream@hotmail.com % Example: % N = 100; %network size (number of nodes)
Bif
- matlab 图像双边滤波器，系统地循环每个像素并相应地调整相邻像素的权重来保留锐边。(This preserves sharp edges by systematically looping through each pixel and adjusting weights to the adjacent pixels accordingly.)
POCS算法
- 基于POCS的超分辨率重建，对边缘具有保留作用(Super-resolution reconstruction based on POCS can preserve edges)
Burgers_equation
- The 1D Burgers equation is solved using explicit spatial discretization (upwind and central difference) with periodic boundary conditions on the domain (0,2). The 2D case is solved on a square domain of 2X2 and both explicit and implicit methods are
StructureLearningLibraries-master
- 贝叶斯网络又称信度网络，是Bayes方法的扩展，是目前不确定知识表达和推理领域最有效的理论模型之一。从1988年由Pearl提出后，已经成为近几年来研究的热点.。一个贝叶斯网络是一个有向无环图(Directed Acyclic Graph,DAG),由代表变量结点及连接这些结点有向边构成(Bayesian network, also known as belief network, is an extension of Bayes method and one of the most effec
special effects
- 图片特效处理源码，有冰冻、熔铸、连环画、柔化美白、照亮边缘、羽化效果等六种图片处理效果(Source code for image special effects processing, including six kinds of image processing effects such as freezing, melting casting, comic strip, softening and whitening, illuminating edges, feathering)
网络抗毁性，MATLAB仿真
- Matlab中对建立好的网络进行节点/连边随机、蓄意攻击，用最大连通子图、网络效率来衡量网络的抗毁性，并找出最关键的节点的仿真程序。(In MATLAB, the nodes / edges of the established network are attacked randomly and intentionally. The invulnerability of the network is measured by the maximum connectivity sub graph a
最小生成树
- 问题描述：给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。 基本要求： 1、城市间的距离网采用邻接矩阵表示，邻接矩阵的存储结构定义采用课本中给出的定义，若两个城市之间不存在道路，则将相应边的权值设为自己定义的无穷大值。要求在屏幕上显示得到的最小生成树中包括了哪些城市间的道路，并显示得到的最小生成树的代价。 2、表示城市间距离网的邻接矩阵（要求至少6个城市，10条边） 3、最小生成树中包括的边及其权值，并显示得到的最小生成树的代价。