搜索：Closest
找到约 7 项符合「Closest」的查询结果
结果 7
https://www.eeworm.com/dl/663/460315.html
VHDL/FPGA/Verilog
Closest Point Search in Lattices
Closest Point Search in Lattices
https://www.eeworm.com/dl/650/165314.html
人工智能/神经网络
The Hopfield model is a distributed model of an associative memory. Neurons are pixels and can take
The Hopfield model is a distributed model of an associative memory. Neurons are pixels and can take the values of -1 (off) or +1 (on). The network has stored a certain number of pixel patterns. During a retrieval phase, the network is started with some initial configuration and t ...
https://www.eeworm.com/dl/665/237668.html
matlab例程
ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors
ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors with the closest model points and data points.
Ordinary usage:
[R, T] = icp(model,data)
INPUT:
model - matrix with model points,
data - matrix with data points,
OUTPUT:
R ...
https://www.eeworm.com/dl/693/154065.html
GPS编程
abel Tool Sample Requires: Visual Basic 6 and MapObjects 2.x Data: redlands.shp (Redlands sample
abel Tool Sample
Requires: Visual Basic 6 and MapObjects 2.x
Data: redlands.shp (Redlands sample data set from MO 2.x)
Interactive Labeling Tool
If the check box is checked, then the mouse down location will search for the closest line, and label it with the street name. If the ...
https://www.eeworm.com/dl/639/241526.html
文件格式
We propose a novel approach for head tracking, which combines particle filters with Isomap. The part
We propose a novel approach for head tracking, which combines particle filters with Isomap. The particle filter works on the low-dimensional embedding of training images. It indexes into the Isomap with its state variables to find the closest template for each particle. The most ...
https://www.eeworm.com/dl/654/351489.html
数据结构
用prim算法实验最小生成树 本程序中用到函数adjg( )
用prim算法实验最小生成树
本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树
定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。
定义二维数组g[ ...
https://www.eeworm.com/dl/694/255947.html
并行计算
How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters S
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 trainin ...