- precomputing
- Precomputing
Большой англо-русский и русско-английский словарь. 2001.
precomputing
Смотреть что такое "precomputing" в других словарях:
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia
Clenshaw–Curtis quadrature — and Fejér quadrature are methods for numerical integration, or quadrature , that are based on an expansion of the integrand in terms of Chebyshev polynomials. Equivalently, they employ a change of variables x = cos θ and use a discrete… … Wikipedia
Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… … Wikipedia
Partial evaluation — In computing, partial evaluation is a technique for program optimization by specialization.A computer program, prog , is seen as a mapping of input data into output data::prog : I {static} imes I {dynamic} o OI {static}, the static data , is the… … Wikipedia
Key derivation function — KDF redirects here. For the Nazi organization, see Kraft durch Freude In cryptography, a key derivation function (or KDF) is a function which derives one or more secret keys from a secret value and/or other known information such as a password or … Wikipedia
Bitap algorithm — The bitap algorithm (also known as the shift or, shift and or Baeza Yates Gonnet algorithm) is a fuzzy string searching algorithm developed by Udi Manber and Sun Wu in 1991ref|Manber91ref|Manber92 based on work done by Ricardo Baeza Yates and… … Wikipedia
Benaloh cryptosystem — The Benaloh Cryptosystem is an extension of the Goldwasser Micali cryptosystem (GM) created in 1994 by Josh (Cohen) Benaloh. The main improvement of the Benaloh Cryptosystem over GM is that longer blocks of data can be encrypted at once, whereas… … Wikipedia
Lowest common ancestor — This article is about lowest common ancestors in graph theory and computer science. For the common ancestor of a set of species in evolutionary trees, see most recent common ancestor. For a common ancestor of all life forms, see last universal… … Wikipedia
precompute — v., precomputed, precomputing. * * * … Universalium
precompute — v., precomputed, precomputing … Useful english dictionary
