Source Code Online Home Categories Top Code New Code Submit Code
Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
phpFox Chat Module 3.7 3.7
PHPtravels 2.0
VISCOM TIFF Viewer ActiveX SDK 11.06
NanoSpell TinyMce SpellChecker Plugin 1.14328
JavaScript Webix Windows& Popups 1.6
VISCOM PDF SDK ActiveX 8.26
AIEngine 0.6
JaavScript Webix Toolbar 1.7
VISCOM Image Thumbnail ActiveX SDK 5.15
PaGoDump for PostgreSQL 9.3.4
Alvas.Audio 2014.0
NLance Enterprise Demo – Freelance Clone Enterprise
JavaScript Webix DataTable 1.6
RSS Content Generator Professional 3.36.86
VISCOM Audio Capture Pro ActiveX SDK 2.19
Top Code
Theater Management Software 1.0.4
Inout Support Desk Manager 1.0
dbExpress Driver for PostgreSQL 3.3
dbForge Fusion for Oracle 3.5
Thumbtack Clone 1.0b2
Furon 1.0
Automated Scheduler and Alert System 1.0
Edutella - a P2P network for RDF data 1.0
FJSP Software 1.0
sourcecode2html 0.0.1
DrupalChat 7.x-1.0-beta0
HTML2Book 6.x-1.0
PHPNuke Text Ads Module 1.0
List of references 1.0
Simple Website System 0.7.2
Top Search
Photo Add Comment Php
Source Code Of Add Comment In Php
Login Page Code Using Html
Dirty Word
Add Comment Script
Wap Forum Script
Cms Vimp In Centos
Carpooling Website Php
Login Page Code Using Jsp
Asp Net Projects With Free Source Code
Hostel Mess Management Project Code In C
Small Game In Computer Graphics
File Anti Leechcachedyou
Movistar Planet
Thrisha Bathroom Video Without Dress Free Download
Related Search
K Nearest Neighbor Java
Code For K Nearest Neighbor In Java
K Nearest Neighbor
K Nearest Object Java
K Nearest Neighbor Algorithm
K Nearest Neighbor Algorithm C Codesourse
K Nearest Neighbor Classification
K Nearest Neighbor Clustering
K Nearest Neighbor Exam Value Full Application C
K Nearest Neighbor C Code
K Nearest Neighbor Code In Delphi
Nearest Neighbor Java
K Nearest Neighbor Code
K Nearest Neighbor Algorithms
K Nearest Neighbor Algorithm For Points
 K Nearest Neighbor Java 

Code 1-20 of 60   Pages: Go to  1  2  3  Next >>  page  



This is just a brute force implementation of k nearest neighbor search without using any fancy data structure, such as kd-tree. However it is the fastest knn matlab implementation I can find.

A partial sort mex function is implemented which is a simple wrapper of c++ partial_sort.

Provided the sort function, the matlab code is only of two lines. However, it is extremely fast.

install:
build;



This is a small but efficient tool to perform K-nearest neighbor search, which has wide Science and Engineering applications, such as pattern recognition, data mining and signal processing.

The code was initially implemented through...



A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc.



A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc.







A fast artificial intelligence library which currently supports:
kNN (k-Nearest Neighbor algorithm)
MLP (Multilayer-Perceptron)



gaKnn(Genetic Algorithm Optimized K Nearest Neighbor Classification framework) is a frameowork for KNN optimization with a genetic algorithm. The genetic algothm used for this is JGAP (http://jgap.sourceforge.net/).



This method produces different results depending on what city is choosen as the starting point.

This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes.



This implements a KDTree for nearest neighbor and range searching.The KDTree stores a N-dimensional set of points. The tree can be queried for all points within a Euclidian range in order O(sqrt(p)+k) time, where p is the number of points and k is...



Connects randomly ordered 2D points into a minimal nearest neighbor contour.
points2contour
Tristan Ursell
February 2012

[Xout,Yout]=points2contour(Xin,Yin,P,direction)

Given any list of 2D points (Xin,Yin),...



Using Nearest Neighbor-, Linear-, or Bicubic- Interpolation



Fuzzy k-nearest neighbors classifier that can work with training samples whose label info is fuzzified. The prototype is as follows.

[y,predict_class] = f_knn(tr,tr_memberships,te,k)

tr: training samples
tr_memberships:...



Sar-K is a Java tool to generate code for user interfaces, model classes and data access layer based on a database model. Sar-K can access many database engines and produces code in many languages and architectures using customizable templates.



This implementation includes modules for radiometric enhancement of colored 3D point clouds and nearest neighbor search. The introduced method detects the overlapping parts and derives a transformation function that reduces radiometric...



The kd-tree can be used to organize efficient search for nearest neighbors in a k-dimensional space.



kdtree provides a minimalistic implementation of kd-tree. The implementation can be used either inside MATLAB by means of MEX calls, or as a standalone tool, directly from a C/C++ program. The image on the website has been creaed with...



This is an implementation of [1]. The result is slightly different from website[1], because we apply adjacent neighborhood rather than K nearest neighborhood.

The following is an example usage:

%complie:(only once)



function nimg = imresample(oldpixsize,img,newpixsize,intmethod)

% This function resamples the images at the new grid points
% defined by the new pixel sizes. It assumes that intensities are
% defined at pixel centers
%



The code uses array indexing to implement shifting of the matrix. It is about 2.5 times faster than using interp2 with 'nearest neighbor' option for shifting of the matrices. Inspiration for optimized array indexing comes from a snippet on...



This function completes what I have started with the functions variogram and variogramfit. It is not intended to be a highly optimized code for performing kriging but may have educational value. Note that for using kriging, you should download the...



In this file you can find a simple but very effective algorithm for Nearest Neighbour Search which I megalomaniacly called the GLTree.

You want more? go to the Professional version of GLTree

It has been designed for uniformly...