Results 61 to 70 of about 1,756,456 (179)
An empirical study of Python hash tables [PDF]
, 2023 This research thesis explores the performance aspects of hash tables in Python, with a specific emphasis on Python sets, examining the internal factors that influence their efficiency.
Estevao Bazilio, Lucas
core
EFFICIENT SELF-ADJUSTING HASH TABLE [PDF]
, 2015 Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for an efficient self-adjusting hash table. An aspect may include hash tables that include hints that describe where objects may be found in the hash table.
Lebar, Justin, Pike, Geoffrey
core +1 more source
IEEE Access, 2020 MD5 is a one-way cryptographic function used in various fields for maintaining data integrity. The application of a Hash function can provide much protection and privacy and subsequently reduce data usage.
Ammar Mohammed Ali, Alaa Kadhim Farhan
doaj +1 more source
When Are Learned Models Better Than Hash Functions? [PDF]
arXiv, 2021 In this work, we aim to study when learned models are better hash functions, particular for hash-maps. We use lightweight piece-wise linear models to replace the hash functions as they have small inference times and are sufficiently general to capture complex distributions.
arxiv
A class of structured P2P systems supporting browsing [PDF]
, 2009 Browsing is a way of finding documents in a large amount of data which is complementary to querying and which is particularly suitable for multimedia documents.
Cohen, Julien
core +2 more sources
, 2010 In this work we have compared two indexing algorithms that have been used to index and retrieve Carnatic music songs. We have compared a modified algorithm of the Dual ternary indexing algorithm for music indexing and retrieval with the multi-key hashing
Amudha, A. +3 more
core +1 more source
Separate Chaining Meets Compact Hashing [PDF]
arXiv, 2019 While separate chaining is a common strategy for resolving collisions in a hash table taught in most textbooks, compact hashing is a less common technique for saving space when hashing integers whose domain is relatively small with respect to the problem size.
arxiv
Space-efficient computation of k-mer dictionaries for large values of k
Algorithms for Molecular BiologyComputing k-mer frequencies in a collection of reads is a common procedure in many genomic applications. Several state-of-the-art k-mer counters rely on hash tables to carry out this task but they are often optimised for small k as a hash table keeping ...
Diego Díaz-Domínguez +2 more
doaj +1 more source
Optimize data-driven multi-agent simulation for COVID-19 transmission
BMC Bioinformatics, 2022 Background Multi-Agent Simulation is an essential technique for exploring complex systems. In research of contagious diseases, it is widely exploited to analyze their spread mechanisms, especially for preventing COVID-19.
Chao Jin +4 more
doaj +1 more source
Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information. [PDF]
PLoS ONE, 2016 Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of deterministic finite automatons (DFAs). A minimization algorithm is presented in this paper that consists of two main phases.
Desheng Liu +4 more
doaj +1 more source