Description: 这是用matlab编写的有关动态规划算法中回溯的实现，是串匹配时用的-This is prepared using matlab on the dynamic programming algorithm realize the back is used when string matching Platform: |
Size: 8192 |
Author: |
Hits:
Description: 使用 c++ 写的图像处理平台 ，支持 belief propogation, dynamic programming,graphic cut. 等算法 ，在vs2005 下调试通过 ，如果 不会使用，请发邮件 walwj@sohu.com 咨询-Use c++ Write image processing platform, to support the belief propogation, dynamic programming, graphic cut. Such as algorithms, under the debugger in VS2005 is passed, if not used, please email walwj@sohu.com Advisory Platform: |
Size: 13400064 |
Author:david |
Hits:
Description: 用动态规划算法思想求最小编辑距离，即近似字符串匹配问题-Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem Platform: |
Size: 1024 |
Author:Doreen |
Hits:
Description: 自由始端和终端的动态规划,求指标函数最小值的逆序算法递归
％ 计算程序。x是状态变量，一列代表一个阶段状态；M-函数
％ DecisFun(k,x)由阶段k的状态变量x求出相应的允许决策变量
％ M-函数ObjFun(k,x,u)是阶段指标函数，M-函数TransFun(k,x,u)
％ 是状态转移函数,其中x是阶段k的某状态变量，u是相应的决策变量；
％ 输出p_opt由4列构成，p_opt=[序号组 最优策略组 最优轨线组
％ 指标函数值组]；fval是一个列向量，各元素分别表示p_opt各
％ 最优策略组对应始端状态x的最优函数值；
％-Start a free client and terminal dynamic programming, and the reverse indicator function of the minimum calculation algorithm recursive. x is the state variable, a state on behalf of a stage M-function DecisFun (k, x) by the phase k of state variable x obtained the permission of the corresponding decision variable M-function ObjFun (k, x, u) is the phase indicator function, M-function TransFun (k, x, u) is the state transition function, x is the phase in which a k state variables, u is the corresponding decision variable output p_opt from 4 poses, p_opt = [serial number of group Optimal Strategy Group Group optimal trajectory indicator function value group] fval is a column vector, each element of the, respectively, the optimal strategy p_opt group before the end of the corresponding optimal state function x Platform: |
Size: 2048 |
Author:haiyan |
Hits:
Description: 此文件夹中共包括十二个小程序
AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除
Boyer_Moore算法的串模式匹配
Horspool算法的串模式匹配
Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历
HeapSort利用堆排序实现优先级队列
Merge实现二路归并排序算法
MFK动态规划解背包问题
nqueue求解n皇后问题
QuickSort快速排序算法的实现。
Shell排序算法的实现。
Tree程序中实现了先序\中序\后序遍历二叉树的非递归算法。
tubao用递归法解决突包问题-This folder, including the Chinese Communist AVL applet 12 to create a balanced binary tree, by adding a node to create, and achieving a balanced binary tree of nodes to delete Boyer_Moore algorithm Horspool string pattern matching the string pattern-matching algorithm Graph to achieve a directed graph breadth-first traversal non-recursive and non-recursive depth-first traversal HEAPSORT HeapSort use to achieve the realization of priority queue Merge merge sorting algorithm Road MFK knapsack problem dynamic programming solution of n queen problem solving nqueue rapid QuickSort sort algorithm. Shell Sort Algorithm. Tree process sequence to achieve the first \ in the sequence \ after the sequence of the non-recursive binary tree traversal algorithm. tubao recursive method used to solve the issue of sudden package Platform: |
Size: 374784 |
Author:zouyan |
Hits:
Description: 用LCS方法解决字符匹配问题，用到动态规划的思想。原创-LCS solution with matching characters, the idea of using dynamic programming Platform: |
Size: 1024 |
Author:bohu |
Hits:
Description: 我备战2010数学建模美赛所精心准备的算法资料，一共13个算法。应该说是目前比较全的算法集了。每个算法由一个VC6例子实现，来解决一个问题。其中一些是自己编写，其它的也是由网上找到后经过修改编译通过的。比赛结果还不错，一个M，现在把资料共享出来，希望对大家有所帮助，算法主要有模拟退火，遗传算法，蒙特卡罗算法，蚁群算法，粒子群算法，元胞自动机，Dijkstra，最小生成树算法，二分图最大匹配算法，最大流算法，动态规划算法，分支定界法，排队论算法，决策论算法等，我写了个说明文件，列的挺详细的-I am preparing for 2010 U.S. race mathematical modeling algorithms are well-prepared data, a total of 13 algorithms. It should be said is a relatively wide set of algorithms. Each algorithm implementation from a VC6 example, to solve a problem. Some of which I have written, the other is modified by the web, compiled by the post. Results also good, a M, is now sharing the information out, we want to help, mainly simulated annealing algorithm, genetic algorithm, Monte Carlo algorithm, ant colony algorithm, particle swarm optimization, cellular automata, Dijkstra, minimum spanning tree algorithm, the maximum bipartite matching algorithm, maximum flow algorithm, dynamic programming, branch and bound method, queuing theory algorithms, decision theory algorithm, I wrote a documentation out very detailed Platform: |
Size: 1355776 |
Author:一招鲜 |
Hits:
Description: 这是基于动态规划的立体匹配的代码，是当前立体匹配中很好的一种实现方式-This is the stereo matching based on dynamic programming code that is currently in a good stereo matching method to implement Platform: |
Size: 222208 |
Author:gengyingnan |
Hits:
Description: DTW（Dynamic Time Warping，动态时间归整）算法，该算法基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题，是语音识别中出现较早、较为经典的一种算法。-DTW (Dynamic Time Warping, Dynamic Time Warping) algorithm based on dynamic programming (DP) ideas, to solve the pronunciation of different lengths of the template matching problem, is the speech recognition appeared in the early, more of a classical algorithm. Platform: |
Size: 6144 |
Author:伏伊宁 |
Hits:
Description: DTW（Dynamic Time Warping，动态时间归整）算法，该算法基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题，是语音识别中出现较早、较为经典的一种算法。用于孤立词识别，DTW算法与HMM算法在训练阶段需要提供大量的语音数据，通过反复计算才能得到模型参数，而DTW算法的训练中几乎不需要额外的计算。所以在孤立词语音识别中，DTW算法仍然得到广泛的应用。 -DTW (Dynamic Time Warping, dynamic time warping) algorithm based on dynamic programming (DP) ideas, sounds of varying lengths to solve the template matching problem, is speech recognition appeared earlier, more classic kind of algorithm. For isolated word recognition, DTW algorithm and HMM algorithm in the training phase need to provide a large number of voice data, obtained by repeated calculations to model parameters, while the DTW algorithm is almost no additional training calculations. Therefore, in isolated word speech recognition, DTW algorithm is still widely used. Platform: |
Size: 6144 |
Author:fujuan |
Hits:
Description: 动态规划算法的相关文档。动态规划算法可用于很多方面，比如立体匹配等。-Dynamic programming algorithm documentation. Dynamic programming algorithm can be used in many aspects, such as stereo matching. Platform: |
Size: 251904 |
Author:linjingliang |
Hits:
Description: 本文件为国外立体匹配算法解释的PPT文档，主要是立体匹配中的动态规划算法。里面有两个文件。-This document is to explain foreign PPT stereo matching documents, mainly in the dynamic programming stereo matching algorithm. There are two files. Platform: |
Size: 1725440 |
Author:linjingliang |
Hits:
Description: function dist = dtw(t,r)
n = size(t,1)
m = size(r,1)
帧匹配距离矩阵
d = zeros(n,m)
for i = 1:n
for j = 1:m
d(i,j) = sum((t(i,:)-r(j,:)).^2)
end
累积距离矩阵
D = ones(n,m) * realmax
D(1,1) = d(1,1)
动态规划
for i = 2:n
for j = 1:m
D1 = D(i-1,j)
if j>1
D2 = D(i-1,j-1)
else
D2 = realmax
end
if j>2
D3 = D(i-1,j-2)
else
D3 = realmax
end
D(i,j) = d(i,j) + min([D1,D2,D3])
end
end
dist = D(n,m) -function dist = dtw (t, r) n = size (t, 1) m = size (r, 1) frame matching distance matrix d = zeros (n, m) for i = 1: n for j = 1: md (i, j) = sum ((t (i,:)-r (j ,:)).^ 2) end end cumulative distance matrix D = ones (n, m)* realmax D ( 1,1) = d (1,1) dynamic programming for i = 2: n for j = 1: m D1 = D (i-1, j) if j> 1 D2 = D (i-1, j-1) else D2 = realmax end if j> 2 D3 = D (i-1, j-2) else D3 = realmax end D (i, j) = d (i, j)+ min ( [D1, D2, D3]) end end dist = D (n, m) Platform: |
Size: 1024 |
Author:ydh |
Hits:
Description: DTW（Dynamic Time Warping，动态时间归整）算法，该算法基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题-A Dynamic Warping, DTW (Dynamic Time GuiZheng) algorithm, which is based on Dynamic programming (DP) ideas, solving the pronunciation different length of template matching problem
Platform: |
Size: 2048 |
Author:jieli |
Hits:
Description: 本项目将多尺度理论、动态规划法、模式识别和区域划分等技术应用到图像的立体匹配之中，减少立体匹配过程中的搜索空间、计算时间和匹配错误；-This project will multi-scale theory, the dynamic programming, pattern recognition and regional division technology application of image matching of three-dimensional, reduce the search space stereo matching process, and computing time and matching error
Platform: |
Size: 73728 |
Author:蒋星星 |
Hits:
Description: 介绍动态规划法的设计思想并举例，有串匹配问题，排序问题，组合问题中的动态规划法，既有伪代码也有源程序-Design ideas of the dynamic programming method, and for example, the string matching problem, scheduling problem, dynamic programming in combinatorial problems, both pseudo-code source Platform: |
Size: 175104 |
Author:乔艳梅 |
Hits:
Description: K-近似匹配，动态规划法。输入两个文本和编辑距离k，找出k以内的文本匹配情况。代码很短短，没有相当算法功底很难看懂。最好参考经典的算法设计书籍。-K-approximate matching, dynamic programming method. Two input text and edit distance k, find k within the text to match. The code is a short, not quite algorithms foundation is difficult to understand. The best reference to the classic algorithm design books. Platform: |
Size: 17408 |
Author:qindan |
Hits:
Description: 动态编程，DNA 序列对比，最长公共子序列。一对DNA 序列可以手动输入，匹配参数，误配参数，和惩罚值可根据实验要求改变-Dynamic programming, DNA sequence comparison, the longest common subsequence. The DNA sequence can be entered manually, matching parameters mis-parameters, and the penalty value can be changed according to the experimental requirements Platform: |
Size: 4311040 |
Author:bovey |
Hits:
Search - dynamic programming matching