Results 121 to 130 of about 447,111 (170)

Robust multi-read reconstruction from noisy clusters using deep neural network for DNA storage. [PDF]

Comput Struct Biotechnol J
Qin Y, Zhu F, Xi B, Song L.
europepmc   +1 more source

Indexing and searching petabase-scale nucleotide resources. [PDF]

Nat Methods
Shiryev SA, Agarwala R.
europepmc   +1 more source

Secure and energy-efficient inter- and intra-cluster optimization scheme for smart cities using UAV-assisted wireless sensor networks. [PDF]

Sci Rep
Gharaei N, Alabdali AM.
europepmc   +1 more source

HP-YOLOv8: High-Precision Small Object Detection Algorithm for Remote Sensing Images. [PDF]

Sensors (Basel)
Yao G, Zhu S, Zhang L, Qi M.
europepmc   +1 more source

Access authentication via blockchain in space information network. [PDF]

PLoS One
Arshad M, Jianwei L, Khalid M, Khalid W, Cao Y, Khan FA.   +5 more
europepmc   +1 more source

Dynamic Perfect Hashing: Upper and Lower Bounds

SIAM Journal on Computing, 1988
The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a randomized algorithm for the dynamic dictionary problem that takes $O(1)$ worst-case time for lookups and $O(1)$ amortized expected time for insertions and ...
Kurt Mehlhorn, Hans Rohnert, Martin Dietzfelbinger, Anna R. Karlin, Robert E. Tarjan, F.M. auf der Heide   +5 more
semanticscholar   +8 more sources

A dictionary implementation based on dynamic perfect hashing

ACM Journal of Experimental Algorithmics, 2008
We describe experimental results on an implementation of a dynamic dictionary. The basis of our implementation is “dynamic perfect hashing” as described by Dietzfelbinger et al. ( SIAM J. Computing 23 , 1994, pp. 738--761), an extension of the storage scheme proposed by Fredman et al. ( J. ACM
Christoph Weidling, Martin Hühne, Martin Dietzfelbinger   +2 more
semanticscholar   +4 more sources

Dynamic Perfect Hashing with Finite-State Automata

Intelligent Information Systems, 2006
Minimal perfect hashing provides a mapping between a set of n unique words and n consecutive numbers. When implemented with minimal finite-state automata, the mapping is determined only by the (usually alphabetical) order of words in the set. Addition of new words would change the order of words already in the language of the automaton, changing the ...
Denis Maurel, Jan Daciuk, Agata Savary
semanticscholar   +4 more sources

Perfect Hashing for Method Dispatch with Dynamic Typing and Dynamic Compilation

, 2012
In static typing, the receiver's static type is the key to efficient implementation of method invocation, and a recently proposed technique, based on perfect hashing of classes, cannot apply to dynamic typing because of the lack of static types. In this article, we propose a new application of perfect hashing to method dispatch in a dynamic typing ...
Roland Ducournau
openaire   +3 more sources

Filter Based Data Deduplication in Cloud Storage Using Dynamic Perfect Hash Functions

International journal of simulation: systems, science & technology, 2018
M. Rao, B. Reddy
openaire   +2 more sources