Search - binary AND tree

Search - binary AND tree - List

[matlab] callandput DL : 0: 利用二叉树及蒙特卡罗方法计算欧式美式权证的例程，需要的可自行下载-binary tree using the Monte Carlo method and the American Continental E routines, and we need to be downloaded
Date : 2026-01-01 Size : 2kb User : 张扬
[matlab] PatternRecognition DL : 0: 1.Fisher分类算法 2.感知器算法 3.最小二乘算法 4.快速近邻算法 5.K-近邻法 6.剪辑近邻法和压缩近邻法 7.二叉决策树算法-1.Fisher Classification Algorithm 2. Perceptron algorithm 3. Least-squares algorithm 4. Fast nearest neighbor 5.K-neighbor method 6. Clips neighbor neighbor method and compression method 7. Binary Decision Tree Algorithm
Date : 2026-01-01 Size : 8kb User : wct
[matlab] temp DL : 0: 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.
Date : 2026-01-01 Size : 2kb User : Ashish
[matlab] ovsf DL : 0: 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 mutually orthogonal to each other. These codes are derived from an OVSF code tree, and each user is given a different, unique code. An OVSF code tree is a complete binary tree that reflects the construction of Hadamard matrices.
Date : 2026-01-01 Size : 2kb User : deep
[matlab] dsatbx DL : 0: matlab数据结构算法工具箱, 包括堆栈队列 2叉树红黑树 -Data Structures & Algorithms Toolbox ==================================== The Data Structures & Algorithms Toolbox provides advanced data structures and algorithms for the Matlab(r) 5 environment. It implements functions to create and destroy singly and doubly linked list, stack, queue, binary tree and red-black (balanced) binary tree. Data elements can be inserted, deleted or searched for. A graphical representation of trees can be shown. All algorithms are clearly written as m-files, which allows the toolbox to be used as a teaching aid in educational data structures courses. This is the first implementation available of advanced datatypes, common in other languages, for Matlab.
Date : 2026-01-01 Size : 114kb User : austin
[matlab] C4_5.m DL : 0: 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 possible tests that can split the data set and selects a test that gives the best information gain. For each discrete attribute, one test with outcomes as many as the number of distinct values of the attribute is considered. For each continuous attribute, binary tests involving every distinct values of the attribute are considered. In order to gather the entropy gain of all these binary tests efficiently, the training data set belonging to the node in consideration is sorted for the values of the continuous attribute and the entropy gains of the binary cut based on each distinct values are calculated in one scan of the sorted data. This process is repeated for each continuous attributes.
Date : 2026-01-01 Size : 2kb User : rajesh
[matlab] imagdetect DL : 0: 学习matlab图像处理的绝对有用的程序，所有程序均调试通过，程序代码说明 P0401：用Prewitt算子检测图像的边缘 P0402：用不同σ值的LoG算子检测图像的边缘 P0403：用Canny算子检测图像的边缘 P0404：图像的阈值分割 P0405：用水线阈值法分割图像 P0406：对矩阵进行四叉树分解 P0407：将图像分为文字和非文字的两个类别 P0408：形态学梯度检测二值图像的边缘 P0409：形态学实例——从PCB图像中删除所有电流线，仅保留芯片对象 -Learn matlab image processing of absolute useful program, all procedures is commissioning, the program code instructions： P0401: use Prewitt operator detection image edges P0402: with different sigma value of image edge detection LoG operator P0403: with the edge of the Canny operator detection images P0404: image threshold segmentation P0405: water line threshold value method segmentation images P0406: four binary tree of matrix decomposition P0407: will the image into text and erbal two
Date : 2026-01-01 Size : 40kb User : zhuzhu
[matlab] combine---two-binary-trees- DL : 0: 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 tree into the first tree as 005 * its left child and if the first tree has the left child tree,then insert the first tree 006 * into the second tree as its left child. -This is 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 tree into the first tree as 005* its left child and if the first tree has the left child tree, then insert the first tree 006* into the second tree as its left child.
Date : 2026-01-01 Size : 1kb User : liuyijun
[matlab] tree DL : 0: 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 topology of the 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 topology of the tree.
Date : 2026-01-01 Size : 60kb User : ThUND3R
[matlab] LatticeEur-Put-and-Call-option DL : 0: 欧式看涨和看跌期权价格的二叉树求解以及平价法则的验证.-European call and put option prices binary tree solving and verification of the parity law.
Date : 2026-01-01 Size : 1kb User : 杨叶艺
[matlab] LATTICE-EUR-AMR--CALL DL : 0: 基于二叉树定价原理的对于美式看涨期权和欧式看涨与看跌期权的模拟-Analog for the American call option and the European call and put options based on binary tree pricing
Date : 2026-01-01 Size : 2kb User : 阮雅琨
[matlab] CRR_Asian DL : 0: 亚式期权的二叉树及三叉树算法。很容易改编为其他的强路径依赖期权代码。-Asian option binary and ternary tree algorithms. Easily adapted for other strong path-dependent option code.
Date : 2026-01-01 Size : 2kb User : zhuang fei die
[matlab] array DL : 0: 和Huffman-Tree一样，Shannon-Fano coding也是用一棵二叉树对字符进行编码。但在实际操作中呢，Shannon-Fano却没有大用处，这是由于它与Huffman coding相比，编码效率较低的结果（或者说香农-范诺算法的编码平均码字较大）。-And Huffman-Tree, like, Shannon-Fano coding is using a binary character coding. However, in practice it, Shannon-Fano, but not much use, since it is compared with the Huffman coding, coding efficiency is the result of a lower (or Shannon- Fano coding algorithm larger average code word).
Date : 2026-01-01 Size : 1kb User : ray
[matlab] binary-anti-collision DL : 0: 对二进制传统搜索算法及二叉树和四叉树的混合算法进行了matlab程序仿真-Binary search algorithm and mixed traditional binary and quad-tree algorithm were matlab simulation program
Date : 2026-01-01 Size : 46kb User : 周菲
[matlab] Matlab-GUI-tuxiangchuli DL : 0: 利用MATLAB中的GUI（图形用户界面），实现图像的读取，边缘检测，四叉树分解，直方图阈值分割，二值化差值的实现，并设计了退出按钮。-In MATLAB GUI (graphical user interface), to achieve image reading, edge detection, quad-tree decomposition, histogram thresholding, binary difference implementations and designed the Exit button.
Date : 2026-01-01 Size : 1.96mb User : konghao
[matlab] Bidirectional Rapidly-exploring Random Trees DL : 1: 基于二值图的路径规划，rrt算法。双向优化，通过起点与终点双点发展扩展树，优化处理速度。(Path planning based on binary graph, RRT algorithm. Two way optimization, through the start and end point of the expansion tree development, optimize the processing speed.)
Date : 2026-01-01 Size : 1.94mb User : c123x