Results 61 to 70 of about 168,960 (287)
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
Advanced Intelligent Systems, EarlyView.A zero‐watermarking algorithm that combines a refined convolutional additive self‐attention vision transformer (CAS‐ViT) with a discrete wavelet transform variance‐based feature descriptor (DVFD) is proposed for protecting the privacy of medical images in mobile healthcare services.
Pei Liu +6 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
More Analysis of Double Hashing for Balanced Allocations
, 2015 With double hashing, for a key $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +i g(x)) \bmod n$ for $i=0,1,2,...$ to generate multiple hash values in the range $[0,n-1]$ from the initial two.
Mitzenmacher, Michael
core +1 more source
On Routing in Distributed Hash Tables [PDF]
Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), 2007 There have been many proposals for constructing routing tables for distributed hash tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allow order-preserving hash functions that lead to a skewed peer distribution in the identifier space.
Fabius Klemm +3 more
openaire +1 more source
Material‐Based Intelligence: Autonomous Adaptation and Embodied Computation in Physical Substrates
Advanced Intelligent Systems, EarlyView.This perspective formulates a unifying framework for Material‐Based Intelligence (MBI), defining the physical requirements for materials to achieve embodied action, active memory and embodied information processing through intrinsic nonequilibrium dynamics. The design of intelligent materials often draws parallels with the complex adaptive behaviors of
Vladimir A. Baulin +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
, 2016 We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$ are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we use $h(x)$ in hashing with chaining to insert $n$ elements into a table of size $n$ the expected ...
Knudsen, Mathias Bæk Tejs
core +1 more source
Accelerating Hash-Based Query Processing Operations on FPGAs by a Hash Table Caching Technique [PDF]
, 2017 Extracting valuable information from the rapidly growing field of Big Data faces serious performance constraints, especially in the software-based database management systems (DBMS).
Arcas-Abella, Oriol +4 more
core +1 more source