Search for "Hashing" in article titles:

1. Spiral Hashing: Spiral hashing, also known as Spiral Storage is an extensible hashing algorithm. Like in all hashing schemes, spiral hashing stores records in a varying number of buckets, using a record key for addressing. [100%] 2022-06-02 [Search algorithms] [Hashing]...
2. Hashing Algorithm: In computing, a hashing algorithm is a computational process which takes an input of bytes and reduces it to a fixed length base64 string which is unique (within boundaries) to the input. Hashes are mainly used for data integrity, and ... [100%] 2023-02-04 [Computers]
3. Password Hashing Competition: The Password Hashing Competition was an open competition announced in 2013 to select one or more password hash functions that can be recognized as a recommended standard. It was modeled after the successful Advanced Encryption Standard process and NIST hash ... (Open competition to select password hash functions) [81%] 2023-03-17 [Password authentication]
4. Universal hashing: In mathematics and computing, universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). This guarantees a low number ... (Technique for selecting hash functions) [100%] 2023-12-18 [Cryptographic hash functions] [Hashing]...
5. Linear hashing: Linear hashing (LH) is a dynamic data structure which implements a hash table and grows or shrinks one bucket at a time. It was invented by Witold Litwin in 1980. [100%] 2023-07-10 [Search algorithms] [Hashing]...
6. Extendible hashing: Extendible hashing is a type of hash system which treats a hash as a bit string and uses a trie for bucket lookup. Because of the hierarchical nature of the system, re-hashing is an incremental operation (done one bucket ... [100%] 2023-09-20 [Search algorithms] [Hashing]...
7. Linear hashing: Linear hashing (LH) is a dynamic data structure which implements a hash table and grows or shrinks one bucket at a time. It was invented by Witold Litwin in 1980. [100%] 2023-10-30 [Search algorithms] [Hashing]...
8. Cuckoo hashing: Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup time. The name derives from the behavior of some species of cuckoo, where the cuckoo ... (Data structure hashing scheme) [100%] 2022-06-16 [Search algorithms] [Hashing]...
9. Universal hashing: In mathematics and computing, universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). This guarantees a low number ... (Technique for selecting hash functions) [100%] 2023-05-18 [Cryptographic hash functions] [Hashing]...
10. Double hashing: Double hashing is a computer programming technique used in conjunction with open addressing in hash tables to resolve hash collisions, by using a secondary hash of the key as an offset when a collision occurs. Double hashing with open addressing ... [100%] 2023-12-29 [Search algorithms] [Hashing]...
11. Perceptual hashing: Perceptual hashing is the use of a fingerprinting algorithm that produces a snippet or fingerprint of various forms of multimedia. A perceptual hash is a type of locality-sensitive hash, which is analogous if features of the multimedia are similar. (Class of fingerprinting algorithm) [100%] 2022-12-29 [Hashing]
12. Spiral hashing: Spiral hashing, also known as Spiral Storage is an extensible hashing algorithm. As in all hashing schemes, spiral hashing stores records in a varying number of buckets, using a record key for addressing. [100%] 2023-04-14 [Search algorithms] [Hashing]...
13. Zobrist hashing: Zobrist hashing (also referred to as Zobrist keys or Zobrist signatures ) is a hash function construction used in computer programs that play abstract board games, such as chess and Go, to implement transposition tables, a special kind of hash table ... (Hash function construction used in computer programs that play abstract board games) [100%] 2023-10-22 [Computer Go] [Game artificial intelligence]...
14. Bitstate hashing: Bitstate hashing is a hashing method invented in 1968 by Morris. It is used for state hashing, where each state (e.g. [100%] 2022-11-23 [Hash functions]
15. Cuckoo hashing: Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup time. The name derives from the behavior of some species of cuckoo, where the cuckoo ... (Data structure hashing scheme) [100%] 2022-07-20 [Search algorithms] [Hashing]...
16. Static hashing: Static Hashing is another form of the hashing problem which allows users to perform lookups on a finalized dictionary set (all objects in the dictionary are final and not changing). Since static hashing requires that the database, its objects and ... [100%] 2022-10-19 [Hashing]
17. Geometric hashing: In computer science, geometric hashing is a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an affine transformation, though extensions exist to other object representations and transformations. In an off-line step, the objects ... [100%] 2024-08-08 [Geometric data structures] [Search algorithms]...
18. Dynamic perfect hashing: In computer science, dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure. While more memory-intensive than its hash table counterparts, this technique is useful for situations where fast queries, insertions, and deletions ... (Programming technique for resolving duplcate hash values in a hash table data structure) [81%] 2023-02-07 [Hashing] [Search algorithms]...
19. Dynamic perfect hashing: In computer science, dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure. While more memory-intensive than its hash table counterparts, this technique is useful for situations where fast queries, insertions, and deletions ... (Programming technique for resolving duplcate hash values in a hash table data structure) [81%] 2022-02-09 [Hashing] [Search algorithms]...
20. 2-choice hashing: 2-choice hashing, also known as 2-choice chaining, is "a variant of a hash table in which keys are added by hashing with two hash functions. The key is put in the array position with the fewer (colliding) keys. [81%] 2024-04-14 [Hashing]
21. Locality-sensitive hashing: In computer science, locality-sensitive hashing (LSH) is a fuzzy hashing technique that hashes similar input items into the same "buckets" with high probability. (The number of buckets is much smaller than the universe of possible input items.) Since similar ... (Algorithmic technique using hashing) [81%] 2024-09-25 [Search algorithms] [Classification algorithms]...
22. Sparse binary polynomial hashing: Sparse binary polynomial hashing (SBPH) is a generalization of Bayesian spam filtering that can match mutating phrases as well as single words. SBPH is a way of generating a large number of features from an incoming text automatically, and then ... [70%] 2023-03-21 [Bayesian statistics] [Spam filtering]...