Location:
Search - K-D
Search list
Description: 空间数据库中空间数据结构的应用，K-d树基本操作的源码，都在这个文档中。-spatial database structure of the data space applications, K-d trees basic operation of the source code in the documents.
Platform: |
Size: 6435 |
Author: 周琳 |
Hits:
Description: 空间数据库中空间数据结构的应用，K-d树基本操作的源码，都在这个文档中。-spatial database structure of the data space applications, K-d trees basic operation of the source code in the documents.
Platform: |
Size: 6144 |
Author: 周琳 |
Hits:
Description: 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.
Platform: |
Size: 31744 |
Author: 李中 |
Hits:
Description: 纸牌接龙游戏
把所有牌按花色依次从小到大（ A 到 K ）捡到右边的红色框中，全部捡完游戏结束。
主要操作有：鼠标单击和双击，没有拖动。
规则 1：方块接方块，草花接草花，从大到小的接（比如：方块8要接到方块9的下面）
规则 2：K 可以移到空的绿色框中
规则 3：最小的可以用双击自动移到红色框中
规则 4：点牌要点牌的上半截
规则 5：-poker word games all colors followed by licensing from small to large (A to K) picked up the right side of the red box, all seized End end of the game. Major operations are : mouse click and double-click, no drag. Rule 1 : Block access chunks and then Grasses and bedding plants, beginning with the largest access (for example : Block received eight to nine squares below) Rule 2 : K can be moved to the empty green box three rules : the smallest can double-click automatically moved to the red box Rule 4 : point license plates points the rules on sleeveless 5 :
Platform: |
Size: 77824 |
Author: 香烟 |
Hits:
Description: 高效的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 to use it. All codes are implemented in C++.-Efficient k-means algorithm, the use of a kd tree with local search, such as k-means algorithm to improve the implementation efficiency of the sample code included with c++ Code. Effecient implementation of k-means algorith, kd tree and local search strategy are implementd to improve the effeciency, samples are included to show how to use it. All codes are implemented in C++.
Platform: |
Size: 907264 |
Author: 陈明 |
Hits:
Description: k-d 树的类模板,比较简短.c++代码-kd-tree class template, relatively brief. c++ code
Platform: |
Size: 2048 |
Author: zhengke |
Hits:
Description: k-d tree 算法介绍，介绍了一种可行的方法，从而实现搜素。-kd tree algorithm, the introduction of a feasible way to achieve the Su-found.
Platform: |
Size: 191488 |
Author: sunyifeng |
Hits:
Description: K-D树源码，不错的空间查找算法，在三维重建和匹配中应用较多！-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
Platform: |
Size: 105472 |
Author: yangronghao |
Hits:
Description: 用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.
Platform: |
Size: 302080 |
Author: 翟乐 |
Hits:
Description: 一个KD-tree的类STL模板库，版本为0.7.0-libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree.
Platform: |
Size: 111616 |
Author: 黄常标 |
Hits:
Description: 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.
Platform: |
Size: 624640 |
Author: duckur |
Hits:
Description: ) 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 uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
-) 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 uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
Platform: |
Size: 1024 |
Author: ria |
Hits:
Description: 本压缩包完整地实现了最小可度限制生成树的算法程序，代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete.
Platform: |
Size: 2048 |
Author: 榔头 |
Hits:
Description: 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 Tree
Platform: |
Size: 101376 |
Author: Hydrae |
Hits:
Description: 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 multidimensional search key
Platform: |
Size: 4096 |
Author: Lee Sangmin |
Hits:
Description: 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 multidimensional search key
Platform: |
Size: 4096 |
Author: Lee Sangmin |
Hits:
Description: Min k tree in tabu search
Platform: |
Size: 3072 |
Author: Jung |
Hits:
Description: k-d tree C++ source codes
Platform: |
Size: 9216 |
Author: hui |
Hits:
Description: k d clustering in matlab
Platform: |
Size: 15360 |
Author: mahbob
|
Hits:
Description: 要求有向树Ｔ的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). Similar to the K median problem of the directed tree, it transforms the directed tree into an equivalent two branch tree, and sets the subtree T (x) of T with vertex x as its root, whose left and right son vertices are y and Z, respectively.)
Platform: |
Size: 708608 |
Author: 为了
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
29
»