Results 91 to 100 of about 10,668 (123)

Behavioral Time Scale Synaptic Plasticity (BTSP) endows binding of distributed representations with flexible retrieval options

Yu C, Yang Y, Wu Y, Wang A, Maass W.
europepmc   +1 more source

Tissue determinants of the human T cell receptor repertoire.

Sureshchandra S, Henderson J, Levendosky E, Bhattacharyya S, Kastenschmidt JM, Sorn AM, Mitul MT, Benchorin A, Batucal K, Daugherty A, Murphy SJ, Thakur C, Trask D, Ahuja G, Moisan A, Tiffeau-Mayer A, Saligrama N, Wagar LE.   +17 more
europepmc   +1 more source

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
Dietzfelbinger, Martin, Hühne, Martin, Weidling, Christoph   +2 more
openaire   +3 more sources

Dynamic Perfect Hashing: Upper and Lower Bounds

SIAM Journal on Computing, 1988
Summary: 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 ...
Dietzfelbinger, Martin, Karlin, Anna, Mehlhorn, Kurt, Meyer auf der Heide, Friedhelm, Rohnert, Hans, Tarjan, Robert E.   +5 more
openaire   +2 more sources

Dynamic Perfect Hashing with Finite-State Automata

, 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 ...
Jan Daciuk, Denis Maurel, Agata Savary
openaire   +2 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   +2 more sources

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

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

Extendible RDMA-Based Remote Memory KV Store with Dynamic Perfect Hashing Index

2025 IEEE 41st International Conference on Data Engineering (ICDE)
Zirui Liu, Xian Niu, Wei Zhou, Yisen Hong, Zhouran Shi, Tong Yang, Yuchao Zhang, Yuhan Wu, Yikai Zhao, Zhuochen Fan, Bin Cui   +10 more
openaire   +2 more sources

Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries

, 1998
Peter Bro Miltersen
openaire   +3 more sources

PDPH: A Performant Dynamic Perfect Hash Index with Rehashing Optimizations

2025 IEEE/ACM 33rd International Symposium on Quality of Service (IWQoS)
Jiarui Wang, Xiangyu Zou, Wen Xia, Hao Hu, Xiangrui Meng, Xudong Li   +5 more
openaire   +2 more sources