搜索结果

The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a ...

Huffman codes &#1048708 In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0’s and 1’s? &#1048708 To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. &#1048708 This problem c ...

读取XML信息，显示在tree上。并且提供各种控制功能

This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental m ...

spoj dtree. Count the number of distinct elements in a given range. Usage is done using fenwick trees. Offline algorithm for queries

自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。

一个简单的Ext例子，里面有Ext.grid.GridPanel和Ext.tree.TreePanel等Ext常用控件的使用，以及Ext和后台的交互

伸展树，基本数据结构，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.

ZigBee路由协议指的是ZigBee规范中规定的与路由相关的功能和算法部分，主要包括不同网络拓扑结构下ZigBee协议数据单元的路由方式、路由发现和路由维护等内容。为了达到低成本、低功耗、可靠性高等设计目标，ZigBee网络采用了Cluster-Tree与AODV路由相结合的路由算法。该包实现了ZIGBEE路由算法在NS2下的模拟 ...

一个实现struts+spring+hebernate的例子，外加一个JavaScript实现的tree的都OK了。