搜索资源列表
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
KD_Tree
- KD_Tree In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as searches involving a m
libkdtree_0.7.0
- 一个KD-tree的类STL模板库，版本为0.7.0-libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree.
2
- 一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。 编程任务： 对于给定的n和k(k <= 10000)个加油站位置，编程计算最少加油次数。 -Top up after a car traveling n kilometers. The road has a number of gas stations. Design an effective algorithm that should be docked
PEDump
- PEDUMP程序自从1994年的版本以来，已经有了明显的改善。它可以显示在PE里的每一个数据类型，包括： IMAGE_NT_HEADERS 输入/输出表 资源 基址重定位 debug目录 延迟装入输入表 绑定输入描述符 IA-64异常处理表 TLS初始化数据 .NET运行时头部 除了可导出PE可执行文件外，PEDUMP也能导出COFF格式的OBJ文
kdtree
- In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as searches involving a multidime
tree
- 在线算大，用树套树解决在某区间内部求第K大的数-Line for a major, with tree tree cover to resolve the internal demand in a range of large number of the first K
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
KD-tree
- kd树是一种对k维空间中的实例点进行存储以便对其进行快速搜索的树形数据结构-kd tree is a k-dimensional space for instance points to be stored quickly search tree data structure
tree
- 判断二叉树是否是完全二叉树，求二叉树宽度1：若无左子女则不应该有右子女2.求二叉树宽度3.二叉树k层叶子结点-Determine whether the binary tree is a complete binary tree, binary tree width 1: children should not be left if no children have the right width 3. 2. binary tree binary tree leaf node k layer
K-value-problems-in-the-cod
- 有向树K中值问题，王晓东版算法课后题，有注释，很详细-Directed tree K value problems, Wang Xiaodong version algorithm after-school title, notes, very detailed
minimum-spanning-tree
- 用快速最小生成树使用k-均值方法进行医学图像分割-Medical image segmentation using k- mean value method for fast minimum spanning tree
KD-tree
- C++构建简单的KD树并查找K近邻，是一篇文档，内附代码，代码亲测可用(C++ to build a simple KD tree, and find K nearest neighbor, is a document, enclosing code, code pro test available)
K d tree in matlab
- k d clustering in matlab
pres
- 三种分类器：决策树分类器，k-NN分类器和k-means分类器的运行时间以及运行准确率的比较。(Three kinds of classifiers: decision tree classifier, k-NN classifier and K-means classifier running time and accuracy comparison.)
QRD_MQAM
- 使用K-BEST树型搜索算法和QR分解，检测信号(Detection of signals using the K-BEST tree search algorithm and QR decomposition)
3-18有向树k值
- 要求有向树Ｔ的k个顶点组成的集合Ｆ，使cost(F)=∑min w(x)*d(x,u)的值达到最小。在一般情况下，有向树是一棵多叉树，为了便于计算，我们把多叉树变转成为与之等价的二叉树，将每个顶点的第一个儿子做为其父顶点的左儿子顶点，同时增加一个０权０边长的附加顶点做为右儿子顶点。然后对于其他儿子项点以相同方式作为新增附加顶点的左儿子顶点，一直继续下去，直至处理完所有顶点。所得到的二叉树与树Ｔ具有相同的最小耗费。(A set F that consists of the k vertices o
3-19有向树独立K
- 要求有向树Ｔ的k个独立顶点组成的集合Ｆ，使cost(F)=∑min w(x)*d(x,u)的值达到最小。与有向树k中值问题类似，把有向树变转成为与之等价的二叉树，设Ｔ的以顶点x为根的子树T(x),其左、右儿子顶点分别为y和z。(A set F that consists of a k independent vertex to a tree T is required to minimize the value of the cost (F) = min w (x) *d (x, U). Sim
create_kd_tree
- 通过计算方差，确定划分坐标轴，最后，将点云划分到一个个格子中，这样的好处在于可以将噪点和有效点分别存储于不同的格子中，方便进行去噪。(k-d tree create;By calculating the variance, the coordinate axis is determined. Finally, the point cloud is divided into a number of lattices. The advantage is that the noise and the