搜索资源列表
ANN
- 由国外著名大学编写的非常有效近似最近邻分类算法的源码与库，可直接使用，也可作为学习-Well-known universities from abroad prepared very effective approximate nearest neighbor classification algorithm source code and libraries, can be used directly, can also be used as study
KNN
- KNN clustering with php
moshishibie
- 先用C-均值聚类算法程序，并用下列数据进行聚类分析。在确认编程正确后，采用蔡云龙书的附录B中表1的Iris数据进行聚类。然后使用近邻法的快速算法找出待分样本X（设X样本的4个分量x1=x2=x3=x4=6；子集数l=3）的最近邻节点和3-近邻节点及X与它们之间的距离。-First C-means clustering algorithm procedures and with the following data for cluster analysis. After confirming t
linkstate
- 链路状态路由选择协议的目的是映射互连网络的拓扑结构。每个链路状态路由器提供关于它邻居的拓扑结构的信息。 -Link State Routing Protocol is aimed at mapping the interconnection network topology. Each link state router to provide information on its neighbor' s topology information.
Broad-firstsearch
- 广义优先搜索 广度优先搜索邻居的聚类算法实现-Broad-first search Breadth-First Search neighbor clustering algorithm implementation
router_calc
- 根据一个有权的无向图生成指定结点（路由器）的路由表设有结点N，N的路由表由若干个路由项组成，路由项是<目的结点，下一跳>的二元组，其中目的结点是以N结点为源结点，通过N结点可以直接到达（目的结点是N结点的邻居）或通过N结点的邻居可间接到达的结点，其中下一跳即N结点的某领居，通过该邻居可间接到达目的结点，且到达目的结点的路径为最小代价路径.-According to a right of the undirected graph to generate the specified no
Biblio-java
- This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
Screenshots
- This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
future
- This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
Activity
- This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
Workflow
- This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
BruteSearch
- K-nearest neighbors 搜索 聚类时经常使用的一种方法 国外网站转载- The following utilities are provided: - Nearest neighbor - K-Nearest neighbors - Radius Search They al supports N-dimensions and wor
KMM
- 针对传统快速k-近邻分类算法的缺陷,提出了一种基于近邻搜索的快速k-近邻分类算法———超球搜 索法。该方法通过对特征空间的预组织,使分类在以待分样本为中心的超球内进行,有效地缩小了搜索范围。 -Rapid response to traditional k-neighbors of the defect classification algorithm, a fast search based on neighbor k-neighbor classification algorithm
PSO_Algorithm
- PSO’s precursor was a simulator of social behavior, that was used to visualize the movement of a birds’ flock. Several versions of the simulation model were developed, incorporating concepts such as nearest-neighbor velocity matching and accele
STANN
- STANN是轻量级的邻域搜索C++库, 在低维空间性能极为卓越, 特别是3D空间, 比ann-1.1.1好.-STANN is a lightweight thread-safe library for doing Nearest Neighbor searches. It is designed for low dimensional data sets, preferably 3d
select
- In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic.) This includes the cases of finding the minimum, maximum, and median elements. There are worst-
GIS
- GIS的Arcengine编程，实现了属性查询，空间查询，字段统计，Buffer生成，和最邻近点查询等功能-GIS-Arcengine programming, to achieve the attribute query, spatial query, field statistics, Buffer generation, and the nearest point of query functions
OpenTSTOOL1_02
- 用于非线性时间序列分析的软件包。可用于计算：时间延迟重构，分形维数，互信息，Lyapunov指数，替代数据集，最近临点统计，回归时间，庞加莱截面，非线性预测-TSTOOL is a matlab software package for nonlinear time series analysis. TSTOOL can be used for computing: Time-delay reconstruction, Lyapunov exponents, Fractal dimensions
knnVB
- KNN Classifier code and implementation with Visual Basic