搜索资源列表
Counter
- KNN classifiers, training is training set, testing is test set, D is the distance, D=1 is mandistance D=2 is 欧氏距离 D=3是 infinite norm K is the number of selected neighbors- KNN classifiers, training is traini
tsp_nn
- KNN classifiers, training is training set, testing is test set, D is the distance, D=1 is mandistance D=2 is 欧氏距离 D=3是 infinite norm K is the number of selected neighbors- KNN classifiers, training is traini
tora.tar
- Tora在NS2上的实现代码，包含源文件： tora.h - TORA objects/definitions... tora_dest.h - destinations the routing protocol knows about tora_neighbor.h - per destination neighbors tora_packet.h - packet definitions t
ann_1.1.1
- ANN is a library written in the C++ programming language to support both exact and approximate nearest neighbor searching in spaces of various dimensions. It was implemented by David M. Mount of the University of M
life
- 生命游戏是由英国剑桥大学数学家Conway提出的,游戏的规则是这样的,在一个正方的棋盘格上,每格只有两个状态,”生”和”死”,分别表示是否被一个棋子所占有.每个方格有八个邻格,游戏的规则如下: 1. 对于处在”生态的格,若八个邻居中有2个或3个”生”,则继续存活,否则将因过于孤独或过于拥挤而死亡. 2. 对于处在”死”态的空格,若八个邻格中有3个”生”,则该格转变为”生”(代表繁衍过程),否则继续空着.-Game of Life is
neighbors
- 通过分析VASP计算得到的OUTCAR，分析原子与原子之间的距离-Calculated by analysis of VASP OUTCAR, analysis of the distance between atoms and atomic
classification
- classification algorithm. We use the genetic algorithm and a training data set to learn real-valued weights associated with individual attributes in the data set. We use the k nearest neighbors algorithm to classify new
Personnel
- 人员信息 1、户主基本信息 2、家庭成员基本信息1、2、3、4 、5、6人。 3、房、田、畜、车、邻居住处 4、全部信息有图 5、可以自动搜索用户一旦搜索出用户其它全部资料显示出来。-Personnel information 1, 2 heads of basic information, basic information about family members, 1,2,3,4, 5,6 people.
seed_fill
- 此代码给出了四邻域与八邻域的种子填充数据结构函数源码-Change the code gives the neighbors field and eight neighborhood filled with data structure functions of seed source
NeighborhoodRoughSetBasedFeatureEvaluationAndReduc
- 基于特征评估及约简的邻居粗糙集方法，可以用于粗糙集属性约简-Feature-based assessment and neighbors rough set reduction methods
Klinjin
- 近邻法的基本思想是在测试样本x的k个近邻中，按出现的样本类别来作为x的类别，即先对x的k个近邻一找出它们的类别，然后对x类别进行判别，即在N个训练样本中，找出x的k个近邻。-The basic idea is that neighbors in a test sample x, k-nearest neighbor in categories according to the sample appears as a type of x,
neneifind
- Find Nearest Neighbors on Sphere
SparseLab200-Core
- 基于多帧图像插值（Interpolation）技术的方法是SR恢复技术当中最直观 的方法。这类方法首先估计各帧图像之间的相对运动信息，获得HR图像在非均 匀间距采样点上的象素值，接着通过非均匀插值得到HR栅格上的象素值，最后 采用图像恢复技术来去除模糊和降低噪声（运动估计!非均匀插值!去模糊和 噪声）。-In this paper, we propose a novel method for solv- ing si
Neighbors
- this macro convert the horizontal to vertical many values corresponding to one value
codes
- 1: MSE.m : to perform Mean Square Error between 2 images 2: most.m : to get the most redundant value in a matrix 3: getneighbors.m : to get circular neighbors of pixel 4: ColorSpaceConversion.m : convert an image i
kNearestNeighbors
- program to find the k - nearest neighbors (kNN) within a set of points. Distance metric used: Euclidean distance
Nearest
- K-Nearest Neighbors Algorithm
isomap
- In statistics, Isomap is one of several widely used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional scaling). Isomap is
lle
- Locally-Linear Embedding (LLE)[9] was presented at approximately the same time as Isomap. It has several advantages over Isomap, including faster optimization when implemented to take advantage of sparse matrix algorithm
ltsa
- LTSA[19] is based on the intuition that when a manifold is correctly unfolded, all of the tangent hyperplanes to the manifold will become aligned. It begins by computing the k-nearest neighbors of every point. It compute