Collision
Type: Concept
As of November 2026, Collision has been mentioned in one podcast episode on ICLR (Apr 2014). Desired outcome in hashing for efficient retrieval.
In computer science, a hash collision or hash clash is when two distinct pieces of data in a hash table share the same hash value. The hash value in this case is derived from a hash function which takes a data input and returns a fixed length of bits.
| Mentioned in | 1 episode on 1 podcast (as of November 2026) |
|---|---|
| First heard | Apr 2014 on ICLR |
| Field | Computer Science |
Who talks about Collision on podcasts?
Collision came up; the most recent mention was Apr 2014 on ICLR.
- ICLR14: J Masci: Sparse similarity-preserving hashing on ICLR (Apr 2014)
What is Collision mentioned alongside?
Collision is most often mentioned alongside Similarity-sensitive hashing, Sparsity and Hamming radius.
Affiliated with: Similarity-sensitive hashing
Mentioned together: Sparsity, Hamming radius, Binary vectors, Sign function, Cross SSH, YouTube, Meta Siamese Network, Multi-modal data, Lista Network, Cross-modal learning