搜索资源列表
PackSPIHT
- 该源码是SPIHT即分层树集合划分算法的c代码,希望对搞压缩编码的朋友们有用.-the source of SPIHT hierarchical tree that is set partitioning algorithm c code, hope to engage coding useful friends.
ComboTree_demo
- 在下拉框中的树型控件 分层显示 非常有与比如在 输入地方是 父-省 子-市-the drop-down box in the hierarchical tree control there is a strong input with, for example, the local father-son Province-City
sphit-128-4
- 分层树分割算法的Matlab实现，除编码和解码外，还附有熵编码程序，供研究图像处理的朋友参考使用。-hierarchical tree segmentation algorithm Matlab, in addition to encoding and decoding, but also with entropy coding procedures, Image processing research for a friend use and reference.
MFC-Tree-Control--using
- 网上找的非常基础的文章，测试发现当Single Expand property和Always Show Selection属性同时设置为TRUE时，Always Show Selection会失效，不知道这样的认识对不对？- MFC Tree controls are one of the useful controls to show a hierarchical view of items. They can show the folders list, any parent- child
htmlib7_860
- HTM（Hierarchical Temporal Memory）技术是利用模拟大脑来实现识别的一种方法，nupic公司有开源实现，上面的htmlib包是另一种实现，适合VC++开发，容易集成-Hierarchical Temporal Memory: What s In a Name? The name was chosen for a reason: Hierarchical-- HTMs are organized as a tree-shaped hierarchy of
tree
- 假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。 试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。 ^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the fo
2009_An_Improved_SPIHT_Algorithm_Based_on_Pixel_Do
- 基于像素域的改進的SPIHT算法:分層樹的集分割算法是一種簡單、有效的嵌入式零樹編碼算法.在算法的基礎上提出了一種基于空域的改進方法.首先將圖像的偶數裂像素減去相鄰兩奇數列的均值,形成分裂圖像.然后將分裂圖像的奇數列提取出來作為主圖像,將偶數列提取出來作為幅圖像.最后將主幅圖像以合適的權值分別進行壓縮-Pixel-based domain improved SPIHT algorithm: the set partitioning in hierarchical tree algorithm i
KTree
- 构建一颗分层的结构树，将数据分类别进行索引-Construction of a hierarchical tree structure, the data sub-category index
ZigBee
- Implementation of ZigBee’s Cluster Tree Addressing Scheme and Hierarchical
OpenSwing(1)
- Swing是Java图形用户界面开发时非常重要的轻量级组件，openswing是关于swing开发的一系列有用的实例控件，如日历，层次树-Swing is a Java graphical user interface development is very important when lightweight components, openswing on the swing the development of a number of useful examples of control,
HTR
- Hierarchical tree routing for ZigiBee.
Tree
- 主要是二叉树的一些性质的操作。包括复制，清空，求取树高，树中元素的个数，得到根结点，父亲结点，所有祖先，左儿子，右儿子，插入左儿子，右儿子，查找某个元素，以及前、中、后、层次遍历和相关的操作。另外，可以树形显示这棵树的信息。-Some properties are mainly binary operation. Including reproduction, empty, to strike a tree height, the number of elements in the tree g
RoutinginZigBee
- An IEEE 802.15.4-based Wireless Sensor Network is considered, and the relationship between the IEEE 802.15.4 topology formation mechanism and possible routing strategies at the network layer is studied. Two alternative routing schemes proposed in t
hlda-c
- This code implements hierarchical LDA with a fixed depth tree and a stick breaking prior on the depth weights. An infinite-depth tree can be approximated by setting the depth to be very high. This code requires that you have installed the GSL p
xmltree_src
- 使用msxml读取xml文件，读取的文件信息通过tree控件有层次显示出来，一目了然-Read xml file using msxml, read the file information through a hierarchical tree control is displayed at a glance
Binary-Tree-levorder
- 用C++实现二叉树中的层次遍历（Binary_tree.cpp中），levorder，用的是队列-Use C++ achieve the the hierarchical traversal (Binary_tree.cpp) binary tree, levorder, the queue
HorizontalTreeControl
- This a custom tree control that tries to solve the problem of vertical display of hierarchical data.
tree
- 二叉树的中序、前序、后序的递归、非递归遍历算法，层次序的非递归遍历算法的实现-Binary tree in order, first order, the order of the recursive, non-recursive traversal algorithm, hierarchical sequence of non-recursive traversal algorithm to achieve
Tree-Pass-algorithm-
- 树的周游算法（层次遍历）：树的方法的一种，与先根、后跟相对-Tree travel the algorithm (hierarchical traversal): a tree method, and the first root, followed by a relatively
tree-data
- In computer science, a tree is a widely used data structure that simulates a hierarchical tree structure with a set of linked nodes. A tree can be defined recursively (locally) as a collection of nodes (starting at a root node), where each node