搜索资源列表
Determining_embedding_dimension_for_phase-space_re
- 假近邻方法(False Nearest Neighbor,FNN)求混沌时间序列重构嵌入维-false neighbor approach (False Nearest Neighbor, FNN) for chaotic time series embedding dimension Reconstruction
nearest.txt
- 用java求最短路径问题的 源程序，希望 对 有 用的 人能有 帮助 。
DataLife_Engine_v.8.0_Nulled_by_M.I.D-Team
- DataLife Engine v.8.0 Final with Russian and English Language. Datalfe Engine is a multiplayer Engine for the news organization s own media on the web. Thanks to the powerful system of publication, tuning and editing of news, then a step forward
mytestt
- 垃圾收运车首次从车库出发以及每次从中转站返回时首选距离车库或中转站最近的垃圾收集点，同样垃圾收运车从某一垃圾收集点前往另一收集点时首选距此收集点最近的点。当垃圾负载尽量达到最大装载量时，垃圾收运车再运往中转站。按照前面两个原则收运垃圾，当到达v点完成垃圾收运任务且此时的垃圾车剩余负载为a时，若搜索到的下一垃圾收集点w的垃圾量超过了a，则垃圾车停止前进直接从v点返回中转站，卸载垃圾-Garbage removal truck the first time starting from the gar
ClosetPair
- 实现求解平面最近点对的复杂度为nlgn的算法。程序要求能够自动生成至少100万个点，并利用该算法求解。此外，要求支持图形界面的算法输入与输出。在此基础上，添加n^2级算法的实现，并比较相同规模下，两种算法的时间消耗。-Solving the nearest point on the plane to achieve the complexity of the algorithm for nlgn. Program requires the ability to automatically gen
KDnnTree
- KDnnTree for KD tree construct and search for nearest neighbour
ml-knn
- code for K Nearest Neighbor algorithm in java
KNNcode
- K-Nearest Neighbor datamining code in java
MinDistance_PointPair
- 用java实现的平面上最近点对的查找，包括蛮力法和分治法的实现。-Java implementation of the plane with the nearest point on the search, including the brute force method and the divide and conquer implementation.
pnn
- pair wise nearest neigbor is a methof for data mining
Nearest
- K-Nearest Neighbors Algorithm
BasicBalance
- 负载均衡算法仿真 ：寻找最近的邻居节点 定期交换彼此之间的负载信息-Load Equalization Algorithm: find the nearest neighbor load regular exchange of information between
java
- a Grid-based, and the nearest neighbor clustering algorithm
rotationrar
- Rotation imange with function of rotation matrix.nearest neighbour
place_discovery_using_distancecalculations
- You can use this function to calculating the distance on the real world (in KM) between 2 Location coordinates (Longitudes and lattitudes). Its simple but very rare and very useful if you are gonna make some LBS applications.Its also including sample
TSP
- Nearest Neighbor for Tsp
NN-java
- Java code of Nearest Neighbour s algorithm (K-NN)
K-means
- kmeans算法， K-means算法是最为经典的基于划分的聚类方法，是十大经典数据挖掘算法之一。K-means算法的基本思想是：以空间中k个点为中心进行聚类，对最靠近他们的对象归类。通过迭代的方法，逐次更新各聚类中心的值，直至得到最好的聚类结果-kmeans algorithm, K-means algorithm is the most classic divide-based clustering method is one of the top ten classical data mi
KNN
- java实现KNN(k-Nearest Neighbor algorithm)算法,可以设置改变k值。-The code implement KNN（k-Nearest Neighbor algorithm）algorithm，and you can change the value of K.
Fast-Nearest-Neighbor-Search-with-Keywords
- Conventional spatial queries, such as range search and nearest neighbor retri , involve only conditions on objects’ geometric properties. Today, many modern applications call for novel forms of queries that aim to find objects satisfying both a spati