搜索资源列表
GLTree230909
- In this file you can find a simple but very effective algorithm for Nearest Neighbour Search which I megalomaniacly called the GLTree.
nn
- Nearest neighbour for face recognition
MINND
- Multiple-Instance Nearest Neighbour with Distribution learner.
MINND
- Multiple-Instance Nearest Neighbour with Distribution learner.
MINND
- Multiple-Instance Nearest Neighbour with Distribution learner.
NN_FEX
- i want code for nearest neighbour algorithmn with kalman filtering
nearest_neighbour_OpenCv.cpp
- This neraest neighbour algorithm code written in C++ using OpenCV library-This is neraest neighbour algorithm code written in C++ using OpenCV library
kMean
- Spatial registration of multidate or multisensor images is required for many applications in remote sensing, such as change detection, the construction of image mosaics, DEM generation from stereo pairs, and orthorectifi cation. Registration
knn
- K nearest neighbour classification.Matlab.
Knn
- knn algorithm which is used to find the nearest neighbour
NS2.34-threshold
- threshold utility source code for NS2 v2.34. By this utility you can simply give propagation model and distance between two neighbour nodes and take the receiving threshold (RXThresh_ for Phy/Wireless).
NearestNeighbour3
- 最近邻插值,在图像处理中，对变换后的图像进行插值-Nearest Neighbour interpolating
nearest_neighbor_zoom
- this code discribe the method related to nearest neighbour
OtuzIki
- 32*32 pixels picture to 1024*1024 pixels nearest neighbour transformer
elementaryCellularAutomata1234
- Simulates any 1D nearest-neighbour binary cellular automaton
elementaryCellularAutomata
- Simulates any 1D nearest-neighbour binary cellular automaton
imm3851
- This project describes the work done on the development of an audio segmentation and classification system. Many existing works on audio classification deal with the problem of classifying known homogeneous audio segments. In this work, audio recordi
kmeansicml03
- This is K-Nearest Neighbour tutorial
Tight-words
- 描述: 提出了一个字母,一个…{ 0 },< = k - k < = 9。我们说一个字的长度n在这个字母是紧如果任何两个邻居位数不同的词不超过1。输入是一个序列的线,每行包含两个整数n、k和1 < = n < = 100。在每一行输入、输出的百分比的长度n多紧单词字母{ 0、1、……,凯西} 5分形位数。 样本输入: 4一 2 5 3 - 5 8 7 样本输出: 100.00000 40.74074 17.3828
regionpushrelabel-v1.01
- 适用于大型网格图的最大流最小割算法，适合初学者-The regionpushrelabel-v1.03 library computes max-flow/min-cut on huge N-dimensional grid-graphs in graphics, vision, and medical imaging. The C++ implementation is designed specifically for multi-core systems and graphs larger