Results 51 to 60 of about 164,829 (289)
On the insertion time of random walk cuckoo hashing
, 2017 Cuckoo Hashing is a hashing scheme invented by Pagh and Rodler. It uses $d\geq 2$ distinct hash functions to insert items into the hash table. It has been an open question for some time as to the expected time for Random Walk Insertion to add items.
Frieze, Alan, Johansson, Tony
core +1 more source
Advanced Electronic Materials, EarlyView.A high‐density and highly‐reliable capacitive time‐domain (TD) content‐addressable memory (CAM) based on a single ambipolar ferroelectric memcapacitor with band‐reject‐filter‐shaped capacitance‐voltage characteristics is proposed. The proposed TD CAM performs linear Hamming distance computation via propagation delay modulation, achieving improved ...
Minjeong Ryu +5 more
wiley +1 more source
Analysis and Test of Storage Algorithm of Card Reader of Personnel Positioning System
Gong-kuang zidonghua, 2012 The paper analyzed three storage algorithms of chain storage algorithm, hash table storage algorithm and hash binary tree storage algorithm which are applicable to the card reader of personnel positioning system in term of search time and storage ...
ZHANG Feng, XU Zhao, ZHANG Kai-ting
doaj
A hashing technique using separate binary tree
Data Science Journal, 2006 It is always a major demand to provide efficient retrieving and storing of data and information in a large database system. For this purpose, many file organization techniques have already been developed, and much additional research is still going on ...
Md Mehedi Masud +3 more
doaj +1 more source
Advanced Intelligent Discovery, EarlyView.This study introduces a tree‐based machine learning approach to accelerate USP8 inhibitor discovery. The best‐performing model identified 100 high‐confidence repurposable compounds, half already approved or in clinical trials, and uncovered novel scaffolds not previously studied. These findings offer a solid foundation for rapid experimental follow‐up,
Yik Kwong Ng +4 more
wiley +1 more source
OpenFlow table lookup scheme integrating multiple-cell Hash table with TCAM
Tongxin xuebao, 2016 In OpenFlow networks,switches accept flow rules through standardized interfaces,and perform flow-based packet processing.To facilitate the lookup of flow tables,TCAM has been widely used in OpenFlow switches.However,TCAM is expensive and consumes a large
Chun-qiang LI +2 more
doaj +2 more sources
Avoiding Rotated Bitboards with Direct Lookup [PDF]
, 2007 This paper describes an approach for obtaining direct access to the attacked squares of sliding pieces without resorting to rotated bitboards. The technique involves creating four hash tables using the built in hash arrays from an interpreted, high level
Tannous, Sam
core
Trusty URIs: Verifiable, Immutable, and Permanent Digital Artifacts for Linked Data [PDF]
, 2014 To make digital resources on the web verifiable, immutable, and permanent, we propose a technique to include cryptographic hash values in URIs. We call them trusty URIs and we show how they can be used for approaches like nanopublications to make not ...
A. Callahan +12 more
core +4 more sources
Securing Generative Artificial Intelligence with Parallel Magnetic Tunnel Junction True Randomness
Advanced Intelligent Systems, EarlyView.True random numbers can protect generative artificial intelligence (GAI) models from attacks. A highly parallel, spin‐transfer torque magnetic tunnel junction‐based system is demonstrated that generates high‐quality, energy‐efficient random numbers.
Youwei Bao, Shuhan Yang, Hyunsoo Yang
wiley +1 more source
Efficient Processing of Continuous Join Queries using Distributed Hash Tables [PDF]
, 2008 International audienceThis paper addresses the problem of computing approximate answers to continuous join queries. We present a new method, called DHTJoin, which combines hash-based placement of tuples in a Distributed Hash Table (DHT) and dissemination
Akbarinia, Reza +3 more
core +4 more sources