搜索资源列表
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
FileLister
- 利用java+corba技术实现远程访问文件系统，模拟网上邻居的功能。-use java corba Remote Access Technology File System, simulated online neighbor function.
KNN
- 最近邻分类java实现，还有测试用例，这是用eclipse开发的，也可以把源文件拷贝出来。-nearst neighbor java
AdHocnetworkprogram
- 本文提出了一种E-AODV，对AODV做了两大改进：设计了一种邻节点发现规程（NDP），该规程为AODV设计而独立于AODV，可以被移植到其他路由协议中，它为路由协议提供了一种检测链路状态和邻节点发现的底层支持，并避免了单向链路和不稳定链路的产生。其次，将源路由技术引入到采用距离矢量技术的AODV中.-This thesis provides an Enhanced-AODV routing protocol that improves AODV in two sides: introduce
ml-knn
- code for K Nearest Neighbor algorithm in java
KNNcode
- K-Nearest Neighbor datamining code in java
BasicBalance
- 负载均衡算法仿真 ：寻找最近的邻居节点 定期交换彼此之间的负载信息-Load Equalization Algorithm: find the nearest neighbor load regular exchange of information between
java
- a Grid-based, and the nearest neighbor clustering algorithm
KNN
- A graphical software to illustrate the process of KDD (Knowledge Data Discovery) using the KNN (K near neighbor) method. The SW was developed in JAVA and is the code is commented. Works on linux and Windows.
manolin-DV(New)
- 模拟路由器，距离向量算法实现路由更新。能向邻居节点发送路由信息，能够发送数据。-Analog router, distance vector routing algorithm updates. Can send routing information to neighbor nodes to send data.
CANNY
- CANNY EDGE DETECTION Canny edge detection 的步驟： 1. 將原始影像和高斯濾波器做摺積。 2. 利用一次微分的遮罩對影像每一個像素求得四個方向的邊線強度 3. 找出四個方向中的最大值作為目前像素的邊線強度。 4. 依據步驟 3 將梯度方向分成四個區域 5. 非最大值刪除：沿著梯度方向找出最大值，並將其保留，其餘均設為零。 6. 設定兩個閥值 low T 和 high T ，用 high T 挑選出最佳的邊線像素，再從
TSP
- Nearest Neighbor for Tsp
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.
KDTree
- k-d树（k-dimensional树的简称），是一种分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索（如：范围搜索和最近邻搜索）。用java实现，可直接运行-kd-tree (k-dimensional tree for short), is a partition the data structure of k-dimensional data space. Mainly used in the search of the key data of the multidimensi
KDTree2Kmeans
- 基于kdtree的kmeans聚类算法，在选择最近邻中心点时使用kdtree的检索功能，提高了检索效率，特别是当k较大时，效果明显提升-kmeans clustering algorithm based on kdtree，used in selecting the center point of the nearest neighbor the kdtree retrieval function, and improve the retrieval efficiency has improve
maxFirst.src
- ICDE论文MaxFirst代码，是双色反最近邻的重要论文-ICDE papers MaxFirst code, is an important color papers reverse nearest neighbor
KNN
- 是K最邻近结点算法的缩写形式，是电子信息分类器算法的一种。KNN方法对包容型数据的特征变量筛选尤其有效。-The K nearest neighbor node algorithm abbreviated form of electronic information is a classification algorithm. KNN method based on the inclusion of data characteristic variable filter is particula
knn
- 使用java实现数据分类算法最近邻分算法knn，没有使用数据库，直接将数据存储在arraylist中-Using java nearest neighbor classification algorithm for data points algorithms knn, do not use a database, the data is stored directly in the arraylist
Graph-traversal
- 图的遍历： （1）访问初始顶点v并标记顶点v已访问。 （2）查找顶点v的第一个邻接顶点w。 （3）若顶点v的邻接顶点w存在，则继续执行；否则回溯到v，再找v的另外一个未访问过的邻接点。 （4）若顶点w尚未被访问，则访问顶点w并标记顶点w为已访问。 （5）继续查找顶点w的下一个邻接顶点wi，如果v取值wi转到步骤（3）。直到连通图中所有顶点全部访问过为止。 （1）顶点v入队列。 （2）当队列非空时则继续执行，否则算法结束。 （3）
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