Skip to search formSkip to main contentSkip to account menu

Rendezvous hashing

Known as: Highest random weight hashing 
Rendezvous or highest random weight (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of k options out of a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Cache Array Routing ProtocolConsistent hashingDistributed hash tableHash table

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Structured Learning of Binary Codes with Column Generation for Optimizing Ranking Measures
Hashing methods aim to learn a set of hash functions which map the original features to compact binary codes with similarity… 
2015
2015
Propellant-free Spacecraft Relative Maneuvering via Atmospheric Differential Drag
Abstract : At low Earth orbits (LEO), a differential in the drag acceleration between spacecraft can be used to control their… 
2014
2014
An Efficient Image Indexing Method Based on Spectral Hashing with Semantically Consistent Sparcified Graph Laplacian Approach
—Similarity search is one of the most primary problems in information retrieval, and machine learning research groups. The… 
2013
2013
Conclusion âA Rendezvous with DestinyââIf We Choose
2012
2012
Ring-Walk Rendezvous Algorithms for Cognitive Radio Networks
Rendezvous in cognitive radio networks is the process that cognitive users meet and establish a communication link on a commonly… 
2011
2011
Advance Security aspects of Universal Mobile Telecommunication System (UMTS)
Wireless communication is known as key to global development and has become main stream of our daily business. Protecting… 
Review
2003
Review
2003
Several questions on autonomous rendezvous docking
Autonomous Rendezvous Docking have become an important trend of Rendezvous and Docking.The research survey of international… 
1999
1999
Extended Spiral Hashing for Expansible Files
address space allocated to the file to be increased and reduced without reorganizing the whole file. In this paper, we propose a… 
1998
1998
New Methods for Sequential Hashing with Supertrace
Partial search methods like bitstate hashing, or supertrace, allow formal verification techniques to be applied to problems which… 
1983
1983
The Reconstruction and Optimization of Trie Hashing Functions
We propose an adaptation to the trie hashing algorithm published by W. Litwin in 1980. This adaptation extends the algorithm so… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)