- high-speed algorithm
-
быстродействующий алгоритм
English-Russian dictionary of geology. 2011.
high-speed algorithm
Смотреть что такое "high-speed algorithm" в других словарях:
High Resolution CT — or HRCT of the lung is a medical diagnostic test used for diagnosis and assessment of Interstitial lung disease. It involves the use of special computed tomography scanning techniques in order to assess the lung parenchyma.=Technique=HRCT is… … Wikipedia
Speed of sound — Sound is a vibration that travels through an elastic medium as a wave. The speed of sound describes how much distance such a wave travels in a certain amount of time. In SI Units with dry air at 20 °C (68 °F), the speed of sound is 343 m/s. This… … Wikipedia
high-resolution computed tomography — (HRCT) computed tomography that produces images with a high degree of spatial resolution and anatomic detail using a high speed scanner, thin slices, and a special algorithm for reconstructing the image … Medical dictionary
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
TCP congestion avoidance algorithm — The TCP uses a network congestion avoidance algorithm that includes various aspects of an additive increase multiplicative decrease (AIMD) scheme, with other schemes such as slow start in order to achieve congestion avoidance. TCP Tahoe and Reno… … Wikipedia
Alpha max plus beta min algorithm — The alpha max plus beta min algorithm is a high speed approximation of the square root of the sum of two squares. That is to say, it gives the approximate absolute magnitude of a vector given the real and imaginary parts.: |V| = sqrt{ I^2 + Q^2 } … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
Scheduling algorithm — In computer science, a scheduling algorithm is the method by which threads, processes or data flows are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to load balance a system effectively or … Wikipedia
Ziggurat algorithm — The ziggurat algorithm is an algorithm to generate random numbers from a non uniform distribution. It belongs to the class of rejection sampling algorithms and can be used for choosing values from a monotone decreasing probability distribution.… … Wikipedia
Smith-Waterman algorithm — The Smith Waterman algorithm is a well known algorithm for performing local sequence alignment; that is, for determining similar regions between two nucleotide or protein sequences. Instead of looking at the total sequence, the Smith Waterman… … Wikipedia
