Location:
Search - k-tree
Search list
Description: 采用哈夫曼编码思想实现某个文件的压缩和解压缩功能,并提供压缩前后的文件占用空间之比．要求：(1)压缩前文件的规模应不小于５Ｋ．(2)提供原文件与压缩后文件的相同性比较功能．-achieving a file compression function, Compression and provide documents before and after the occupation of space ratio. : (1) compressed documents before the scale should be no less than 5 K. (2) the original of the document after document compression and the same comparison function.
Platform: |
Size: 4112 |
Author: kmisong |
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: 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: 采用哈夫曼编码思想实现某个文件的压缩和解压缩功能,并提供压缩前后的文件占用空间之比．要求：(1)压缩前文件的规模应不小于５Ｋ．(2)提供原文件与压缩后文件的相同性比较功能．-achieving a file compression function, Compression and provide documents before and after the occupation of space ratio. : (1) compressed documents before the scale should be no less than 5 K. (2) the original of the document after document compression and the same comparison function.
Platform: |
Size: 4096 |
Author: kmisong |
Hits:
Description: R+树的c实现源码，对应文章T. K. Sellis, N. Roussopoulos, C. Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects.-R tree c achieve source code, corresponding article T. K. Sellis, N. Roussopoulos, C. Faloutsos : The R-Tree : A Dynamic Index for Multi-Dimensional Objects .
Platform: |
Size: 92160 |
Author: 文 |
Hits:
Description: TV-tree的c实现源码，对应原文章K.-I. Lin, H. V. Jagadish, C. Faloutsos: The TV-Tree: An Index Structure for High-Dimensional Data.-TV-tree c achieve the source, the original corresponding article K.-I. Lin, H. V. Jagadish, C. Faloutsos : The TV-Tree : An Index Structure for High-Dimensional Data.
Platform: |
Size: 316416 |
Author: 文 |
Hits:
Description: K路归并算法，用贪心算法构造霍夫曼树，采用加入虚节点的思想求出最优的归并模式-K Road, merge algorithm, greedy algorithm using Huffman tree constructed using the idea of adding virtual nodes to derive the optimal merging pattern
Platform: |
Size: 3072 |
Author: taolizao |
Hits:
Description: M-Tree (P.Ciaccia VLDB’1997)
VA-File (R. Weber VLDB’1998)
Pyramid-Tree(S.Berchtold SIGMOD’1998)
hybrid-Tree(K.Chakrabarti ICDE’1999)
A-Tree (Y. Sakurai VLDB’2000)
IQ-Tree (S. Berchtold ICDE’2000) -M-Tree (P. Ciaccia VLDB 1997) VA-File (R. Weber VLDB 1998) Pyramid-Tree (S. Berchtold SIGMOD 1998) hybrid-Tree (K. Chakrabarti ICDE 1999) A-Tree (Y. Sakurai VLDB 2000) IQ-Tree (S. Berchtold ICDE 2000)
Platform: |
Size: 945152 |
Author: zhanglei |
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: 用Java编写的KD TREE算法实现, 希望对大家有所帮助-Java prepared using KD TREE algorithm, I hope all of you to help
Platform: |
Size: 1024 |
Author: 阎贺 |
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: 1.Fisher分类算法
2.感知器算法
3.最小二乘算法
4.快速近邻算法
5.K-近邻法
6.剪辑近邻法和压缩近邻法
7.二叉决策树算法-1.Fisher Classification Algorithm 2. Perceptron algorithm 3. Least-squares algorithm 4. Fast nearest neighbor 5.K-neighbor method 6. Clips neighbor neighbor method and compression method 7. Binary Decision Tree Algorithm
Platform: |
Size: 8192 |
Author: wct |
Hits:
Description: 一辆汽车加满油后可行驶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 at what gas stations come on, so come on the least number of along the way. Programming tasks: For a given n and k (k < = 10000) the location of gas stations, at least come on the number of computing programming.
Platform: |
Size: 150528 |
Author: JC |
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: Min k tree in tabu search
Platform: |
Size: 3072 |
Author: Jung |
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: