Location:
Search - m tree
Search list
Description: 此程序给出一个算法，用于计算当已知一个m叉查找树的先序和后序遍历序列后，存在多少种中序遍历可能。输入格式为m s1 s2，其中m表示m叉树，例子
2 abc cba 结果为4
2 abc bca 结果为1
10 abc bca 结果为45
13 abejkcfghid jkebfghicda 结果为207352860-this procedure is an algorithm, When used in the calculation of a known m Binary Search Tree and the first sequence after sequence preorder, the existence of the number of species may preorder. Input format for s1 s2 m, m m-tree said, Example 2 abc cba results abc bca 4 2 1 10 results for the abc bca results for a 45 13 bejkcfghid jkebfghicda results 207352860
Platform: |
Size: 7595 |
Author: 姚秋林 |
Hits:
Description: 小波域的树模型去噪采用ＥＭ算法训练模型参数由Ｍatlab编程实现仿真-Wavelet denoising tree model using EM algorithm training model parameters from Matlab Simulation Programming
Platform: |
Size: 2402 |
Author: 逻辑 |
Hits:
Description: M-Tree (P.Ciaccia VLDB’1997)
VA-File (R. Weber VLDB’1998)
Pyramid-Tree(S.Berchtold SIGMOD’1998)
hybrid-Tree(K.Chakrabarti ICDE’1999)
A-Tree (Y. Sakurai VLDB’2000)
IQ-Tree (S. Berchtold ICDE’2000)
Platform: |
Size: 945847 |
Author: zhanglei |
Hits:
Description: 这是一个用满二叉树解决皇后问题的算法。-This is a binary tree used for the Queen's solution algorithm.
Platform: |
Size: 1418 |
Author: 曹泰瑜 |
Hits:
Description: 这是一个用满二叉树解决皇后问题的算法。-This is a binary tree used for the Queen's solution algorithm.
Platform: |
Size: 1024 |
Author: 曹泰瑜 |
Hits:
Description: This is a simple tool to walk through MIB tree using Simple Network Management Protocol (SNMP). I developed this tool solely for learning. Here, I m presenting this tool to explain the techniques behind SNMP manager (client) development. This tool is not intended for serious managing stuff. But if you want to use it for serious system management, go ahead and use it. I won t stop you. But after that, don t complain to me about the bugs and lacking features ).
Platform: |
Size: 26624 |
Author: 王小文 |
Hits:
Description: C-C方法及改进的C-C方法重构相空间的matlab程序
--------------------------------
性能：
3000数据耗时3分钟
--------------------------------
参考文献：
1、Nonlinear dynamics, delay times, and embedding windows.pdf
2、基于改进的C-C方法的相空间重构参数选择4.pdf
--------------------------------
文件夹说明：
1、C_C_Method_luzhenbo2.m - 程序主文件，直接运行此文件即可!
2、LorenzData.dll - 产生Lorenz离散数据
3、DuffingData.dll - 产生Duffing离散数据
4、RosslerData.dll - 产生Rossler离散数据
5、ccFunction.dll - 计算S(m,N,r,t) - 原C-C方法中计算S(m,N,r,t)，改进的C-C方法中计算S2(m,N,r,t)
6、ccFunction_luzhenbo.dll - 计算S(m,N,r,t) - 改进的C-C方法中计算S1(m,N,r,t)
--------------------------------
致谢：
此稿本次修改的部分灵感来源于与研学论坛网友“张文鸽”和“yangfanboy”的讨论，在此表示感谢!-C-C methodology and improvement of C-C method reconstruction phase space of Matlab procedures-------------------------------- performance : 3000 data time-consuming three minutes------------------------------- References : 1, Nonlinear dynamics, delay times, and embedding windows.pdf 2, Based on the C-C method of phase space reconstruction parameters choice 4.pdf-------------------------------- folders : one, C_C_Method_luzhenbo2.m-main proceedings, direct running this file can be! 2. LorenzData.dll- Lorenz have three discrete data, DuffingData.dll- Duffing have four discrete data, RosslerData.dll- Rossler have discrete data 5, ccFunction.dll-calculated S (m, N, r, t)- the original C-C method to calculate S (m, N, r, t), to improve the C-C method of calculating S2 (m, N, r, t) 6,
Platform: |
Size: 475136 |
Author: jiao |
Hits:
Description: 此程序给出一个算法，用于计算当已知一个m叉查找树的先序和后序遍历序列后，存在多少种中序遍历可能。输入格式为m s1 s2，其中m表示m叉树，例子
2 abc cba 结果为4
2 abc bca 结果为1
10 abc bca 结果为45
13 abejkcfghid jkebfghicda 结果为207352860-this procedure is an algorithm, When used in the calculation of a known m Binary Search Tree and the first sequence after sequence preorder, the existence of the number of species may preorder. Input format for s1 s2 m, m m-tree said, Example 2 abc cba results abc bca 4 2 1 10 results for the abc bca results for a 45 13 bejkcfghid jkebfghicda results 207352860
Platform: |
Size: 7168 |
Author: 姚秋林 |
Hits:
Description: Stack-based sequential decoder for M-QAM modulated MIMO-type problems, i.e., of fixed tree depth.
Platform: |
Size: 36864 |
Author: 王峥 |
Hits:
Description: 小波域的树模型去噪采用ＥＭ算法训练模型参数由Ｍatlab编程实现仿真-Wavelet denoising tree model using EM algorithm training model parameters from Matlab Simulation Programming
Platform: |
Size: 2048 |
Author: 逻辑 |
Hits:
Description: 图论中最小生成树Kruskal算法 及画图程序 M-函数
格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图
例如
n=6 w=inf*ones(6)
w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3]
w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6
[a,b]=mintreek(n,w)
-Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5] w (2, [3,5]) = [5,3] w (3, [4,5,6]) = [5,6,4] w (4,6) = 2 w (5,6) = 6 [a, b] = mintreek (n, w)
Platform: |
Size: 1024 |
Author: lluo |
Hits:
Description: M-Tree (P.Ciaccia VLDB’1997)
VA-File (R. Weber VLDB’1998)
Pyramid-Tree(S.Berchtold SIGMOD’1998)
hybrid-Tree(K.Chakrabarti ICDE’1999)
A-Tree (Y. Sakurai VLDB’2000)
IQ-Tree (S. Berchtold ICDE’2000) -M-Tree (P. Ciaccia VLDB 1997) VA-File (R. Weber VLDB 1998) Pyramid-Tree (S. Berchtold SIGMOD 1998) hybrid-Tree (K. Chakrabarti ICDE 1999) A-Tree (Y. Sakurai VLDB 2000) IQ-Tree (S. Berchtold ICDE 2000)
Platform: |
Size: 945152 |
Author: zhanglei |
Hits:
Description: B树及其B+树的实现代码，支持模版（数据类型，M值）-B tree and its B+ Tree code to support the template (data types, M values)
Platform: |
Size: 8192 |
Author: 许民皆 |
Hits:
Description: 在vc6.0环境中基于mfc的list控件产生的一个派生类，可以在list控件内添加树形控件项目，最终显示结果类似于windows资源管理器左边的导航栏，非常实用，结合了list和tree控件在一起-Vc6.0 environment in the list based on the mfc controls generated a derived class, you can add controls in the list tree control projects, the ultimate result will be displayed similar to windows Explorer left navigation bar, very practical, a combination of list and tree Controls with
Platform: |
Size: 5120 |
Author: 余振江 |
Hits:
Description: 最小生成树，使用PRIM方法生成最小生成树。-Minimum Spanning Tree, use the PRIM method to generate minimum spanning tree.
Platform: |
Size: 1024 |
Author: luke |
Hits:
Description: 最小生成树 MST的四种算法实现。
包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。
复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree
Algorithm
Platform: |
Size: 3918848 |
Author: 黄劲松 |
Hits:
Description: 实现树状目录的显示和在MFC中单文档结构中的实现-Tree implementation of the display and at MFC single document structure in the implementation
Platform: |
Size: 84992 |
Author: 霍丽丽 |
Hits:
Description: 构建M-tree的c++代码，M-tree类似于R-tree，区别于R-tree的是它是基于任意的距离来构建的索引（满足三角不等式）。-C++ code of constructing a M-tree
Platform: |
Size: 143360 |
Author: 告密 |
Hits:
Description: 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.
Platform: |
Size: 2048 |
Author: rajesh |
Hits:
Description: m元树,将m元树转化为二叉树飞源代码，你懂得，很好用-m tree
Platform: |
Size: 896000 |
Author: niba |
Hits: