搜索资源列表
k-d tree C++ source codes
- 空间数据库中空间数据结构的应用，K-d树基本操作的源码，都在这个文档中。-spatial database structure of the data space applications, K-d trees basic operation of the source code in the documents.
k-d tree C++ source codes
- 空间数据库中空间数据结构的应用，K-d树基本操作的源码，都在这个文档中。-spatial database structure of the data space applications, K-d trees basic operation of the source code in the documents.
一种新的聚类分析距离算法
- K均值是一个预先知道类数的算法，需要具备专业知识，不现实。本文提出一个确定类数的方法。-K is a means to know in advance the number of categories algorithm, requires expertise and unrealistic. This paper presents a number of categories to determine the method.
Cell
- 纸牌接龙游戏 把所有牌按花色依次从小到大（ A 到 K ）捡到右边的红色框中，全部捡完游戏结束。 主要操作有：鼠标单击和双击，没有拖动。 规则 1：方块接方块，草花接草花，从大到小的接（比如：方块8要接到方块9的下面） 规则 2：K 可以移到空的绿色框中 规则 3：最小的可以用双击自动移到红色框中 规则 4：点牌要点牌的上半截 规则 5：-poker word games all colors followe
kmlocal-1.7.1.tar
- 高效的k-means算法实现，使用了k-d树与局部搜索等提高k-means算法的执行效率，同时包含示例代码，用c++代码实现。 Effecient implementation of k-means algorith, k-d tree and local search strategy are implementd to improve the effeciency, samples are included to show how
KDTree
- k-d 树的类模板,比较简短.c++代码-kd-tree class template, relatively brief. c++ code
NIPS2005_0433
- k-d tree 算法介绍，介绍了一种可行的方法，从而实现搜素。-kd tree algorithm, the introduction of a feasible way to achieve the Su-found.
kdtree
- K-D树源码，不错的空间查找算法，在三维重建和匹配中应用较多！-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
kdtree
- 用matlab编写的k-dtree，加快搜索，在点云拼合中应用广泛。-Matlab prepared with k-dtree, to speed up the search, put together in the point cloud in a wide range of applications.
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.
KNN
- c++实现的KNN库:建立高维度的K-d tree,实现K邻域搜索，最小半径搜索-K-NN algorithm implementation. It supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily high dimensions.
huffman_coding
- ) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique
K-degree-constrained-minimum-spanning-tree
- 本压缩包完整地实现了最小可度限制生成树的算法程序，代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete.
K-Smallest_Spanning_Trees
- Perharp the smallest spanning tree is trivial, but just take a look with new problem : K Smallest Spanning Tr-Perharp the smallest spanning tree is trivial, but just take a look with new problem : K Smallest Spanning Tre
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,
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
ktree-1
- Min k tree in tabu search
k-d-tree-CPP-source-codes
- k-d tree C++ source codes
K d tree in matlab
- k d clustering in matlab
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