搜索资源列表
the-TSP-program-
- 近邻法求解TSP问题程序设计说明书，针对TSP问题的分析，算法设计！-Neighbor method is used to solve the TSP program design specifications, according to the analysis of the TSP, algorithm design!
DCT
- 提出了一种基于DCT提取人脸特征技术和支持向量机分类模型的人脸识别方法。利用离 散余弦变换可提取人脸可识别的大部分信息,而支持向量机作为分类器,在处理小样本、高维数等 方面具有独特的优势,且泛化能力很强,无需先验知识。从ORL 人脸库上的实验结果可以看出, DCT特征提取是很有效的,且SVM的分类性能优于最近邻分类器,同时提高了整个系统的运算速 度。-A face recognition method based on DCT for face feature extractio
Routing-algorithm
- 链路状态算法（也称最短路径算法）发送路由信息到互联网上所有的结点，然而对于每个路由器，仅发送它的路由表中描述了其自身链路状态的那一部分,其算法思想是每一个路由算法必须完成以下的工作，发现它的邻居节点，并知道其网络地址，测量到各邻居节点的延迟或者开销，构造一个分组，分组中包含所有它刚刚知道的信息，将这个分组发送给所有其他的路由器，计算出到每一个其他路由器的最短路径-Link state algorithm (also known as the shortest path algorithm) to
MIML-kNN
- It is a matlab code for K Nearest Neighbor algorithm.
Super-resolution-through-
- 超分辨率放大基于邻域嵌入论文pdf包含简介 算法 和 超分结果-Super-Resolution Through Neighbor Embedding
An-improved-K-nearest-neighbor-algorithm-for-text
- its about imporvment of KNN algorithm
Interpolation-Technique-for-WZVC
- The manuscr ipt describes performance comparison of nearest-neighbor interpolation and bilinear to reduce the complexity of decoder WZVC.
hejulei
- 核聚类近邻算法，更多论文www.bysjaid.com-Nuclear neighbor clustering algorithm, more papers www.bysjaid.com
Nearest-Neighbour-Interpolation
- A code for implementing Nearest Neighbor Interpolation
Neighbor-discovery
- 最近通信研究的热门领域，D2D方向的discovery经典文献之一-One of the most popular areas of the recent discovery of classic literature communication studies, D2D direction
new_NE
- 自己编写的领域嵌入代码 已经运行过了 效果还不错-neighbor embedding
LSH
- 用LSH算法实现近似最近邻检索，并提高了效率-With LSH algorithm approximate nearest neighbor search, and improves efficiency
classificiation-algorithm-overview
- 机器学习领域经典分类算法综述，包括Decision Tree（ＩＤ３、C4.5(C5.0)、CART、PUBLIC、SLIQ和SPRINT算法），三种典型贝叶斯分类器（朴素贝叶斯算法、TAN算法、贝叶斯网络分类器），k-近邻 、 基于数据库技术的分类算法（ MIND算法、GAC-RDB算法），基于关联规则（CBA:Classification Based on Association Rule）的分类（Apriori算法），支持向量机分类，基于软计算的分类方法（粗糙集（rough set）、遗传
dynamic-region-merging
- In the proposed algorithm, these two issues are solved by a novel predicate, which is defined by the sequential probability ratio test (SPRT) and the minimal cost criterion. Starting from an over-segmented image, neighboring regions are progressivel
getmswpfeat
- matlab vide the examined window into cells (e.g. 16x16 pixels for each cell). For each pixel in a cell, compare the pixel to each of its 8 neighbors (on its left-top, left-middle, left-bottom, right-top, etc.). Follow the pixels along a circle, i.e
paper2
- LTE系统同频邻区自动邻区关系_ANR_的研究与实现_闵祖光.pdf-Research and implementation of.Pdf LTE system _ Min Zuguang neighboring region with same frequency automatic neighbor relation
PCA-based-facial-recognition
- 基于PCA特征提取和距离哈希K近邻分布的人脸表情识别-PCA-based feature extraction and distribution of K-nearest neighbor distance hash Facial Expression Recognition
Classification-1
- Nearest Neighbor Classification
KNN
- SOPHISTICATED WAY FIND THE SHORTEST DISTANCE AMONG THE NEIGHBOR POINTS
06906053.
- Computation and routing in Mobile Ad hoc Network (MANET) is strongly co-related with power resource. Recent trend is to minimize the power consumption and maximize the computation without hampering the quality of service in MANET. To increase