Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Hash function

Known as: Hashing algorithm, Hashing function, Hashlink 
A hash function is any function that can be used to map data of arbitrary size to data of fixed size. The values returned by a hash function are… Expand
Wikipedia

Related topics

Related topics

50 relations
Abstract data typeArtificial intelligence (video games)BackupBiological database
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Compressing Neural Networks with the Hashing Trick
As deep nets are increasingly used in applications suited for mobile devices, a fundamental dilemma becomes apparent: the trend… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Supervised Discrete Hashing
Recently, learning based hashing techniques have attracted broad research interests because they can support efficient storage… Expand
  • table 1
  • table 2
  • figure 1
  • table 4
  • figure 2
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Hashing with Graphs
Hashing is becoming increasingly popular for efficient nearest neighbor search in massive databases. However, learning short… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Minimal Loss Hashing for Compact Binary Codes
We propose a method for learning similarity-preserving hash functions that map high-dimensional data onto binary codes. The… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Semi-supervised hashing for scalable image retrieval
Large scale image search has recently attracted considerable attention due to easy availability of huge amounts of data. Several… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Learning to Hash with Binary Reconstructive Embeddings
Fast retrieval methods are increasingly critical for many large-scale analysis tasks, and there have been several recent methods… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Merkle-Damgård Revisited: How to Construct a Hash Function
The most common way of constructing a hash function (e.g., SHA-1) is to iterate a compression function on the input message. The… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD
MD5 is the hash function designed by Ron Rivest [9] as a strengthened version of MD4[8]. In 1993 Bert den Boer and Antoon… Expand
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Fast pose estimation with parameter-sensitive hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality… Expand
  • figure 1
  • figure 3
  • table 1
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Hash Functions Based on Block Ciphers: A Synthetic Approach
Constructions for hash functions based on a block cipher are studied where the size of the hashcode is equal to the block length… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 4
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE