The evaluation software will be operational for a limited time only. Please contact your nearest IAR Systems office or IAR Systems distributor if you want to purchase the full version of the product (contact link found below).
标签： operational evaluation software contact
上传时间： 2014-01-01
上传用户：Breathe0125
digital image interpolation techniques including nearest neighbor, bilinear, bicubic and spline interpolation.
标签： interpolation techniques including bilinear
上传时间： 2014-01-06
上传用户：小儒尼尼奥
data mining k nearest neighbour
标签： neighbour nearest mining data
上传时间： 2017-09-15
上传用户：talenthn
Abstract: As electronic systems take over many of the mechanical functions in a car—ranging from engine timing to steering andbraking—there is a growing concern about fault tolerance. There should not be a single point of failure that would prevent a car fromat least "limping" off the road or making it to the nearest service station. Redundant systems, watchdog timers, and other controlcircuits are used to reroute signals and perform other functions that ensure that a vehicle can safely make it off the road when afailure occurs.
上传时间： 2013-11-10
上传用户：diets
Rainbow is a C program that performs document classification usingone of several different methods, including naive Bayes, TFIDF/Rocchio,K-nearest neighbor, Maximum Entropy, Support Vector Machines, Fuhr sProbabilitistic Indexing, and a simple-minded form a shrinkage withnaive Bayes.
标签： classification different document performs
上传时间： 2015-03-03
上传用户：希酱大魔王
物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes
标签： location location-allocation Continuous alternate
上传时间： 2015-05-17
上传用户：kikye
在visual basic环境下，实现k-nearest neighbor算法。
上传时间： 2013-12-08
上传用户：ma1301115706
How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.
标签： the decision clusters Cluster
上传时间： 2013-12-21
上传用户：gxmm
KNN算法的实现，k-nearest neighbors聚类算法的matlab 实现
上传时间： 2013-12-19
上传用户：AbuGe
朴素贝叶斯(Naive Bayes, NB)算法是机器学习领域中常用的一种基于概率的分类算法，非常简单有效。k近邻法(k-nearest Neighbor, kNN)[30,31]又称为基于实例(Example-based, Instance-bases)的算法，其基本思想相当直观：Rocchio法来源于信息检索系统，后来最早由Hull在1994年应用于分类[74]，从那以后，Rocchio方法就在文本分类中广泛应用起来。
上传时间： 2014-01-03
上传用户：wxhwjf
