搜索资源列表
ofdm
- 对OFDM通信系统进行仿真，使用AWGN信道，生成误码率与信噪比的仿真图形，并与理论图形进行比较-The simulation of the OFDM communication system, using the AWGN channel, BER and SNR generated graphic simulation, and compared with the theoretical graph
graphcut
- Graph cut 经典图割算法-Graph cut 经典图割算法
fenshuilingsuanfa
- 基于分水岭算法和图论的图像分割，所使用的方法为分水岭算法和Normalized Cut方法-Based on watershed algorithm and graph theory, image segmentation, the method used as a watershed algorithm and Normalized Cut method
Graph
- 通过深度和广度遍历 实现对图各节点的遍历算法-Achieved by traversing the depth and breadth of the graph traversal algorithm for each node
Dijkstra
- Dijkstra s algorithm!!! How you can find the shortest path in a graph
youxiangxunhuantumigongwentiqiujie
- 有向循环图迷宫问题求解，普通迷宫问题要求找出从迷宫入口到出口的所有路径，而此次研究的主要内容是找出有向循环图中的回路（即容易造成流程死循环的地方），消除循环并找出死结点。与此同时，找出死结点后，其他顶点最终都能够到达迷宫的出口。在实际审计过程中的应用意义则为：确定审计工作在哪一个负责部门完成后，是无法继续向其他负责部门传递审计工作直到完成整个审计流程的。-Directed cyclic graph maze problem solving, general maze problem requir
data-types-graph-can-be-isplayed
- 例子列举了多种数据类型，分别通过graph看能不能显示-Examples cited a variety of data types, respectively, to see through the graph can not be displayed
DFG_fdct
- FDCT源码及其数据流图,用于图像处理或者视频编码解码-FDCT source and the data flow graph
TSP
- 回溯法解决TSP问题，对于任何的无向图，只要存在回路均可找到，无回路也可检测出来！-Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
block
- 这是一款简单的flash动画展示，用简单的画图和笔刷绘制钟摆图形，创建多个图层，调节帧来实现钟摆的的动作。-This is a simple flash animation display, with a simple pendulum graph drawing and brush drawing, create multiple layers, adjusting frame to achieve the pendulum action.
photomontage-pro
- 用BP-S,graph-cut,ICM,TRW等能量优化算法,做全景拼接panorama stitching,对做energy minimization方向的很有帮助-this is an project about panorama stitching using BP-S,graph-cut,ICM,TRW algorithms, which be very useful for reseachers who are interested in energy minimizati
mitk
- 实现了三维超声PNN算法的GPU加速；实现GPU加速的CT圆轨道平板探测器FDK重建算法；提供对canny边缘检测算法的支持；提供交互式graph cut分割方法；实现OSTU分割算法；-Three dimensional ultrasound PNN algorithm GPU acceleration to achieve GPU accelerated CT reconstruction algorithm for circular orbits FDK flat panel detec
matlabyiqunsuanfa
- 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of opt
PrimGraph
- Prim´ s algorithm using graphics finds a minimum spanning tree for a connected weighted undirected graph.
graph
- 输入节点数和变数，生成图的深度优先遍历序列和广度优先遍历序列。-Enter the number of nodes and variables, depth-first traversal graph generated sequence and the breadth-first traversal sequence.
Graph
- 在学习数据结构课程是图的操作基本算法实现-graph
3DGraph
- 用VC++和Measurement Studio下的3D Graph控件实现的三维绘图功能-Using VC++ and Measurement Studio 3D Graph under control to achieve the three-dimensional graphics
Spherical
- 在VC++平台下用MFC和Measurement Studio 6.0中的3D Graph三维曲线控件绘制了一个自动旋转的小球-Platform in VC++ Measurement Studio 6.0 with MFC and the 3D Graph Drawing three-dimensional curve control automatically rotation of a ball
regionbased_seg
- 该程序时Graph Cuts方法做图像分割的一种源程序，做彩色图像分割的，效果还是很不错的-The program Graph Cuts method to do segmentation of a source, do color segmentation, the effect is very good
Graph
- MFC随机生成数据，借此数据生成直方图等统计图-MFC random data,use the data to make graph