Description: 该源码是SPIHT即分层树集合划分算法的c代码,希望对搞压缩编码的朋友们有用.-the source of SPIHT hierarchical tree that is set partitioning algorithm c code, hope to engage coding useful friends. Platform: |
Size: 53765 |
Author:戚丽华 |
Hits:
Description: 在下拉框中的树型控件 分层显示 非常有与比如在 输入地方是 父-省 子-市-the drop-down box in the hierarchical tree control there is a strong input with, for example, the local father-son Province-City Platform: |
Size: 40764 |
Author:zhang |
Hits:
Description: 分层树分割算法的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. Platform: |
Size: 14811 |
Author:刘晓倩 |
Hits:
Description: Tree views are capable of storing hierarchical data, which isn t intuitively serialized. The TreeStore sample is an MDI application which shows a view based on CTreeView and demonstrates loading and saving the content of the control with MFC s CArchive-based serialization. The code is also rife with calls to the item navagation routines of CTreeCtrl, including GetNextSiblingItem(), GetPrevSiblingItem(), and GetParentItem(). Platform: |
Size: 41984 |
Author:陈伟 |
Hits:
Description: Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).
-Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM). Platform: |
Size: 2267136 |
Author:hu |
Hits:
Description: 该源码是SPIHT即分层树集合划分算法的c代码,希望对搞压缩编码的朋友们有用.-the source of SPIHT hierarchical tree that is set partitioning algorithm c code, hope to engage coding useful friends. Platform: |
Size: 53248 |
Author:戚丽华 |
Hits:
Description: 在下拉框中的树型控件 分层显示 非常有与比如在 输入地方是 父-省 子-市-the drop-down box in the hierarchical tree control there is a strong input with, for example, the local father-son Province-City Platform: |
Size: 39936 |
Author:zhang |
Hits:
Description: 分层树分割算法的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. Platform: |
Size: 14336 |
Author:刘晓倩 |
Hits:
Description: Birch:这是一种综合的层次聚类的方法，它介绍了两个概念，聚类特征和聚类特征树，它们是用来表示聚类的。这些结构能够帮助聚类方法能运行得更快，能够处理大数据量。-Birch: It is a comprehensive hierarchical clustering method, it introduces two concepts, clustering features and clustering feature tree, which is used to express clustering. These structures can help clustering method can run faster, can handle large volume of data. Platform: |
Size: 260096 |
Author:达达幽 |
Hits:
Description: 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 nodes. Each node implements a learning and memory function, that is, it encapsulates an algorithm. Lower-level nodes receive large amounts of input and send processed input up to the next level. In that way, the HTM Network abstracts the information as it is passed up the hierarchy.
Temporal-- During training, the HTM application must be presented with objects as they change over time. For example, during training of the Pictures application, the images are presented first top to bottom, then left to right as if the image were moving over time. Note that the temporal element is critical: The algorithm has been written to expect input that changes gradually over time.
Memory-- An HTM application works in two stages, which can be thought of as training memory and using memory. During training, the HTM Network learns to recognize Platform: |
Size: 42444800 |
Author:guowei |
Hits:
Description: 基于像素域的改進的SPIHT算法:分層樹的集分割算法是一種簡單、有效的嵌入式零樹編碼算法.在算法的基礎上提出了一種基于空域的改進方法.首先將圖像的偶數裂像素減去相鄰兩奇數列的均值,形成分裂圖像.然后將分裂圖像的奇數列提取出來作為主圖像,將偶數列提取出來作為幅圖像.最后將主幅圖像以合適的權值分別進行壓縮-Pixel-based domain improved SPIHT algorithm: the set partitioning in hierarchical tree algorithm is a simple, efficient embedded zerotree coding algorithm. In the algorithm based on an improved method based on the airspace. First of all, the even split the image pixels minus the two adjacent odd-numbered out of the mean to form a split image. and then split the images out of the odd-numbered extracted as the main image will be extracted out as even-numbered images. Finally, the main image to the right to appropriate values for compression Platform: |
Size: 310272 |
Author:jason.. |
Hits:
Description: 构建一颗分层的结构树，将数据分类别进行索引-Construction of a hierarchical tree structure, the data sub-category index Platform: |
Size: 2048 |
Author:赵旭 |
Hits:
Description: 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, such as calendars, hierarchical tree Platform: |
Size: 195584 |
Author:zz |
Hits:
Description: 主要是二叉树的一些性质的操作。包括复制，清空，求取树高，树中元素的个数，得到根结点，父亲结点，所有祖先，左儿子，右儿子，插入左儿子，右儿子，查找某个元素，以及前、中、后、层次遍历和相关的操作。另外，可以树形显示这棵树的信息。-Some properties are mainly binary operation. Including reproduction, empty, to strike a tree height, the number of elements in the tree get root node, the father node, all the ancestors, the left son, right son, insert the left son, right son, to find an element, and the former , during and after, hierarchical traversal and related operations. In addition, you can display tree tree information. Platform: |
Size: 10240 |
Author:yezi |
Hits:
Description: 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 the framework of the ZigBee Alliance are analyzed.The first is the well-known Ad-hoc On demand Distance Vector
(AODV) routing protocol, which was designed for highly dynamic application scenarios in wireless ad-hoc networks. The second is
a tree-based routing scheme based on a hierarchical structure established among nodes during the network formation phase. This latter approach, referred to as HERA (HiErarchical Routing Algorithm) in the paper, routes packets from sensors to sink based on the parent-child relationships Platform: |
Size: 173056 |
Author:HArry |
Hits:
Description: A gate level implementation of a Booth Encoded Radix-4 24 bit multiplier with VHDL code in structural form. Carry-save adder and hierarchical CLA adder is used for the component adders in the design. The 12 partial products is a Wallace Adder Tree built from Carry-save adder using 3 to 2 reduction. A hierarchical CLA ( Carry-look-Ahead Adder ) adder is used for the final product generation.
-A gate level implementation of a Booth Encoded Radix-4 24 bit multiplier with VHDL code in structural form. Carry-save adder and hierarchical CLA adder is used for the component adders in the design. The 12 partial products is a Wallace Adder Tree built from Carry-save adder using 3 to 2 reduction. A hierarchical CLA ( Carry-look-Ahead Adder ) adder is used for the final product generation. Platform: |
Size: 7168 |
Author:Michael Lee |
Hits:
Description: 网上找的非常基础的文章，测试发现当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 relationship items etc.,
CTreeCtrl is the class which handles all the MFC Tree Control related operations
. It has all the necessary methods to Add MFC Tree control items, Retrieve selected items, Remove the items and other event handlers needed.
Platform: |
Size: 10240 |
Author:李明 |
Hits:
Description: 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 is a data structure consisting of a value, together with a list of nodes (the "children"), with the constraints that no node is duplicated. Platform: |
Size: 9216 |
Author:aa |
Hits:
Search - Hierarchical Tree