Results 61 to 70 of about 447,111 (170)
Perfect Consistent Hashing [PDF]
arXiv, 2015 Consistent Hashing functions are widely used for load balancing across a variety of applications. However, the original presentation and typical implementations of Consistent Hashing rely on randomised allocation of hash codes to keys which results in a flawed and approximately-uniform allocation of keys to hash codes. We analyse the desired properties
arxiv
Shifting trait coordination along a soil‐moisture‐nutrient gradient in tropical forests
Functional Ecology, Volume 39, Issue 1, Page 21-37, January 2025.Illustration of the French Guiana tropical forest landscape. Author Antia Iglesias Fernandez. Read the free Plain Language Summary for this article on the Journal blog. Abstract Soil nutrients and water availability are strong drivers of tropical tree species distribution across scales.
Marion Boisseaux +18 more
wiley +1 more source
Note on distance matrix hashing [PDF]
arXiv, 2019 Hashing algorithm of dynamical set of distances is described. Proposed hashing function is residual.
arxiv
Multi‐view street view image fusion for city‐scale assessment of wind damage to building clusters
Computer-Aided Civil and Infrastructure Engineering, Volume 40, Issue 2, Page 198-214, 10 January 2025.Abstract Global warming amplifies the risk of wind‐induced building damage in coastal cities worldwide. Existing numerical methods for predicting building damage under winds have been limited to virtual environments, given the prohibitive costs associated with establishing city‐scale window inventories.
D. L. Gu +6 more
wiley +1 more source
Dynamic Ordered Sets with Exponential Search Trees
, 2002 We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structures.
Andersson, Arne, Thorup, Mikkel
core +3 more sources
A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs [PDF]
Algorithmica 2019, 2016 Hash tables are ubiquitous in computer science for efficient access to large datasets. However, there is always a need for approaches that offer compact memory utilisation without substantial degradation of lookup performance. Cuckoo hashing is an efficient technique of creating hash tables with high space utilisation and offer a guaranteed constant ...
arxiv
Deep Hashing: A Joint Approach for Image Signature Learning [PDF]
arXiv, 2016 Similarity-based image hashing represents crucial technique for visual data storage reduction and expedited image search. Conventional hashing schemes typically feed hand-crafted features into hash functions, which separates the procedures of feature extraction and hash function learning.
arxiv
Hash function based secret sharing scheme designs [PDF]
arXiv, 2011 Secret sharing schemes create an effective method to safeguard a secret by dividing it among several participants. By using hash functions and the herding hashes technique, we first set up a (t+1, n) threshold scheme which is perfect and ideal, and then extend it to schemes for any general access structure.
arxiv
Neurons Merging Layer: Towards Progressive Redundancy Reduction for Deep Supervised Hashing [PDF]
arXiv, 2018 Deep supervised hashing has become an active topic in information retrieval. It generates hashing bits by the output neurons of a deep hashing network. During binary discretization, there often exists much redundancy between hashing bits that degenerates retrieval performance in terms of both storage and accuracy.
arxiv
Perfect Hashing for Data Management Applications [PDF]
arXiv, 2007 Perfect hash functions can potentially be used to compress data in connection with a variety of data management tasks. Though there has been considerable work on how to construct good perfect hash functions, there is a gap between theory and practice among all previous methods on minimal perfect hashing.
arxiv