搜索资源列表
shujuyasuo
- 用VB实现数据压缩形成编码 这条增加的边存放在变量tree中的第k个元素上,可以这样认为,tree中从第1 到第k号元素中存放了TE和U的信息。注意:在算法思想中我们特别提醒了TE和U的动 态性,表现在算法中,这种动态性 体现在循环变量k的变化上-VB data compression coding that form the edge of the increase in the variables stored in the tree k elements, we can d
tree
- 采用哈夫曼编码思想实现某个文件的压缩和解压缩功能,并提供压缩前后的文件占用空间之比．要求：(1)压缩前文件的规模应不小于５Ｋ．(2)提供原文件与压缩后文件的相同性比较功能．-achieving a file compression function, Compression and provide documents before and after the occupation of space ratio. : (1) compressed documents before the scal
NIPS2005_0433
- k-d tree 算法介绍，介绍了一种可行的方法，从而实现搜素。
Coordinate
- 基于R树的K近邻查询算法及递增的k近邻查询算法实现-the implemention of R-tree K-nearest neighbor query algorithm and incremental nearest neighbor query algorithm
Binary-Tree
- Cay nhị phan bằ ng danh sách liên kế t-Cay nhị phan bằ ng danh sách liên kế t