搜索资源列表
callandput
- 利用二叉树及蒙特卡罗方法计算欧式美式权证的例程，需要的可自行下载-binary tree using the Monte Carlo method and the American Continental E routines, and we need to be downloaded
C4_5.m
- his algorithm was proposed by Quinlan (1993). The C4.5 algorithm generates a classification-decision tree for the given data-set by recursive partitioning of data. The decision is grown using Depth-first strategy. The algorithm considers all the poss
finace-binary-tree
- 用MATLAB实现金融数学中，关于期权二叉树的算法，非常经典，是我大三时，帮大四的师兄写的-Using MATLAB to achieve financial mathematics, the binary tree algorithm on the options, very classic, is my third time to help write a senior senior
matlab_Robotpath
- 用Matlab实现了机器人最优路径规划中的全局路径规划，算法采用的是基于方向权的二叉树算法。-Using Matlab to achieve the optimal robot path planning in the global path, planning algorithm uses a binary tree algorithm based on the direction.
temp
- Binary tree genrarator up to four bit and same u can do after,Does the fourierseries. Code for manchester coding. Code for instantaneous code.SIMPLEsnr.
ovsf
- orthogonal variable spreading factor (OVSF) is an implementation of Code division multiple access (CDMA) where before each signal is transmitted, the spectrum is spread through the use of a user s code. User s codes are carefully chosen to be mutuall
dsatbx
- matlab数据结构 算法工具箱, 包括堆栈 队列 2叉树 红黑树 -Data Structures & Algorithms Toolbox ==================================== The Data Structures & Algorithms Toolbox provides advanced data structures and algorithms for the Matlab(r) 5 environment. It implem
imagdetect
- 学习matlab图像处理的绝对有用的程序，所有程序均调试通过，程序代码说明 P0401：用Prewitt算子检测图像的边缘 P0402：用不同σ值的LoG算子检测图像的边缘 P0403：用Canny算子检测图像的边缘 P0404：图像的阈值分割 P0405：用水线阈值法分割图像 P0406：对矩阵进行四叉树分解 P0407：将图像分为文字和非文字的两个类别 P0408：形态学梯度检测二值图像的边缘 P0409：形态学实例——从PCB图像中删除所有电流线，仅保留
huffman_encode
- 基于最小二元树的编码传输问题，用Matlab编程求解-Binary tree coding based on minimum transmission problem, solved with the Matlab programming
recognise
- 基于二叉树的多类分类器识别，是模式识别中的基础，对二叉树进行了描述。-Binary tree-based multi-classifier recognition, pattern recognition is based on the binary tree is described.
huisuzuhe
- 利用回溯算法解决组合问题。构造虚拟二叉树，采取深度优先搜索方式得到解。-Backtracking algorithm to solve combinatorial problems. Construct a virtual binary tree, the depth-first search to get the solution.
huffman-code
- The goal of this program is to demonstrate the construction of a huffman encoding tree. The tree is represented as a binary tree using MATLAB s built in treeplot commands. Contruction of the tree as well as the huffman code book will be described in
combine---two-binary-trees-
- This a small program to create indexs for two binary trees and combine them to a new 003 * index tree and output the new tree,the second tree only has the left child tree then 004 * if the first tree has no left child tree,insert the second
huffman_encode
- The goal of this program is to demonstrate the construction of a huffman encoding tree. The tree is represented as a binary tree using MATLAB s built in treeplot commands. Contruction of the tree as well as the huffman code book will be describ
tree
- The function translates from labels of a binary tree to corresponding rows (R) and columns (C) of a 2 dimensional matrix storing the tree according to predefined convention, given below. The storing matrix preserves the fractal-like topolog
binomial-pricing-model
- 二叉树定价模型是期权定价模型中最为简单也是最为实用的定价模型，其极限就是Black sholes定价模型的结果。-Binary tree pricing model is the most simple option pricing model is the most practical pricing model, the limit is Black sholes pricing model results.
LatticeEur-Put-and-Call-option
- 欧式看涨和看跌期权价格的二叉树求解以及平价法则的验证.-European call and put option prices binary tree solving and verification of the parity law.
LatticeAmePut
- 美式看跌期权二叉树算法的matlab程序实现方式m文件-American put option binary tree algorithm
LATTICE-EUR-AMR--CALL
- 基于二叉树定价原理的对于美式看涨期权和欧式看涨与看跌期权的模拟-Analog for the American call option and the European call and put options based on binary tree pricing
tree-code
- 通过绘制二叉分形树比较三种不同算法的效率问题-By drawing binary fractal tree compare the efficiency of three different algorithms