In computer science, a lookup table (LUT) is an array that replaces runtime computation of a mathematical function with a simpler array indexing operation...

In the film and graphics industries, 3D lookup tables (3D LUTs) are used for color grading and for mapping one color space to another. They are commonly...

Table-lookup synthesis (or Wavetable-lookup synthesis) (Roads 1996) is a class of sound synthesis methods using the waveform tables by table-lookup,...

standard table-based approach would require an inconveniently large 65536-entry table. As mentioned in § Generating the lookup table, CRC tables have the...

well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored in the table. Many hash table designs also...

others it is dynamic, typically implemented via a color lookup table (CLUT), a correspondence table in which selected colors from a certain color space's...

halftone image. The lookup table provides a continuous-tone value for a given pixel and its distribution. The corresponding lookup table is obtained before...

The I Ching book consists of 64 hexagrams. A hexagram in this context is a figure composed of six stacked horizontal lines (爻 yáo), where each line is...

The bagua (Chinese: 八卦; pinyin: bāguà; lit. 'eight trigrams') is a set of symbols from China intended to illustrate the nature of reality as being composed...

A CUSIP (/ˈkjuːsɪp/) is a nine-character numeric or alphanumeric code that uniquely identifies a North American financial security for the purposes of...

implement a lookup table with constant worst-case access time. A perfect hash function can, as any hash function, be used to implement hash tables, with the...

common situation is an algorithm involving a lookup table: an implementation can include the entire table, which reduces computing time, but increases...

though it is never used in queries or reports; it is done by creating a lookup table that contains the warehouse surrogate key and the originating key. This...

operations, like traversing iterable data structures (e.g. strings, lookup tables, control tables, linked lists, and tree structures). In particular, it is often...

256-entry lookup table most closely match the two representative colors for each block. The two 8-bit indices pointing to colors in the lookup table are now...

against their corresponding denoted sequence, using a lookup table. In the original paper, this lookup table is encoded and stored alongside the compressed text...

block and its associated four color lookup table. A 2-bit index is used to determine which color from the lookup table will be used for each texel in the...

may manage such a table instead of programmers. Transformation of input values to: an index, for later branching or pointer lookup a program name, relative...

return 1 [by the convention that 0! = 1] else if n is in lookup-table then return lookup-table-value-for-n else let x = factorial(n – 1) times n [recursively...

{\displaystyle c_{0}} and c 1 {\displaystyle c_{1}} , and a 4×4 two-bit lookup table. If c 0 > c 1 {\displaystyle c_{0}>c_{1}} (compare these colors by interpreting...

used to "drive" the logic of the program. A simple example might be a lookup table containing a range of possible input values and a function pointer to...

looked up in a predefined table which contains the necessary interpolation patterns. The interpolation data in the lookup tables are constrained by the requirement...

maintain multiple tables, and each lookup must search through each table. Rainbow tables can achieve similar performance with tables that are k times larger...

11.2 and GNU use a variant lookup table. Instead of 32-bit integers, 64-bit integers are used in the symbol lookup tables. The string "/SYM64/" instead...

The Rijndael S-box is a substitution box (lookup table) used in the Rijndael cipher, on which the Advanced Encryption Standard (AES) cryptographic algorithm...

obstacles are overcome. A simple stemmer looks up the inflected form in a lookup table. The advantages of this approach are that it is simple, fast, and easily...

and specifically in compiler and assembler design, a literal pool is a lookup table used to hold literals during assembly and execution. Multiple (local)...

Its implementation requires only a few instructions, plus a 256-byte lookup table containing a permutation of the values 0 through 255. This hash function...

lookup table with 2m words of n bits each. Fixed tables are normally used, as in the Data Encryption Standard (DES), but in some ciphers the tables are...

result is stored in a lookup table that is indexed by the values of those parameters; the next time the function is called, the table is consulted to determine...