- first nearest neighbour
-
атом первой координационной сферы
Англо-русский словарь терминов металлургии и сварки. 2011.
first nearest neighbour
Смотреть что такое "first nearest neighbour" в других словарях:
Nearest neighbour algorithm — This article is about an approximation algorithm to solve the travelling salesman problem. For other uses, see Nearest neighbor. The nearest neighbour algorithm was one of the first algorithms used to determine a solution to the travelling… … Wikipedia
Nearest and Dearest — First Series (DVD) Format Comedy Created by Vince Powell Harry Drive … Wikipedia
k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… … Wikipedia
Best Bin First — is a computer algorithm which is designed to efficiently find an approximate solution to the Nearest Neighbor Search Problem in very high dimensional spaces. The algorithm is based on a variant of the kd tree search algorithm which makes indexing … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm … Wikipedia
crystal — crystallike, adj. /kris tl/, n., adj., v., crystaled, crystaling or (esp. Brit.) crystalled, crystalling. n. 1. a clear, transparent mineral or glass resembling ice. 2. the transparent form of crystallized quartz. 3. Chem., Mineral. a solid body… … Universalium
Crystal — /kris tl/, n. 1. a city in SE Minnesota, near Minneapolis. 25,543. 2. a female given name. * * * I Any solid material whose atoms are arranged in a definite pattern and whose surface regularity reflects its internal symmetry. Each of a crystal s… … Universalium
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Z-order curve — Not to be confused with Z curve or Z order. Four iterations of the Z order curve … Wikipedia
amorphous solid — ▪ physics Introduction any noncrystalline solid in which the atoms and molecules are not organized in a definite lattice pattern. Such solids include glass, plastic, and gel. Solids and liquids (liquid) are both forms of condensed… … Universalium
