Location:
Search - k-d tree
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: kd树的实现,用到matlab-kd tree realization used Matlab
Platform: |
Size: 114688 |
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-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: 用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: 一个高效的k-d tree实现,可以广泛的应用与图形图像处理。-K nearest neighbor search based on KD-tree
Platform: |
Size: 24576 |
Author: 南亮亮 |
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: kd 近邻查找.
一般用在图像拼接等领域-k-d tree
to find the nearest one
Platform: |
Size: 114688 |
Author: alisha |
Hits:
Description: k-d tree C++ source codes
Platform: |
Size: 9216 |
Author: hui |
Hits:
Description: k-d tree的matlab与VC混合实现,可直接使用-using matlab and VC mix programming to realize kd tree.can be used used directly
Platform: |
Size: 126976 |
Author: |
Hits:
Description: k d clustering in matlab
Platform: |
Size: 15360 |
Author: mahbob
|
Hits: