Results 71 to 80 of about 13,604 (287)
Filter Data Structures:A Survey [PDF]
Filter data structures can approximately determine whether an element exists in a given set.Typical filter data structures,such as Bloom filters,cuckoo filters,and quotient filters,sacrifice query accuracy for lower memory space consumption and lower ...
WANG Hancheng, DAI Haipeng, CHEN Shusen, CHEN Zhipeng, CHEN Guihai
doaj +1 more source
Redox‐Dependent Chaperoning of GBF1 Condensates Regulates Seed Germination in Arabidopsis
In dormant seeds (low ROS), GBF1 forms liquid condensates to repress the germination gene CathB3, and the chaperone GIP1 maintains condensate liquidity and repressive activity. Upon imbibition (high ROS), ROS oxidize GIP1 during germination, impairing its chaperone function.
Yunying Wang, Xiaofeng Fang
wiley +1 more source
Using parallel bloom filters for multiattribute representation on network services
One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters.
Xiao, B, Bin Xiao, Hua, Y, Yu Hua
core +1 more source
BLOOM: BLoom filter based oblivious outsourced matchings
Background Whole genome sequencing has become fast, accurate, and cheap, paving the way towards the large-scale collection and processing of human genome data. Unfortunately, this dawning genome era does not only promise tremendous advances in biomedical
Jan Henrik Ziegeldorf +8 more
doaj +1 more source
Laser‐induced graphene (LIG) provides a scalable, laser‐direct‐written route to porous graphene architecture with tunable chemistry and defect density. Through heterojunction engineering, catalytic functionalization, and intrinsic self‐heating, LIG achieves highly sensitive and selective detection of NOX, NH3, H2, and humidity, supporting next ...
Md Abu Sayeed Biswas +6 more
wiley +1 more source
Distance sensitive bloom filters without false negatives [PDF]
A Bloom filter is a widely used data-structure for representing a set S and answering queries of the form "Is x in S?". By allowing some false positive answers (saying "yes" when the answer is in fact `no') Bloom filters use space significantly below ...
Johan Sivertsen +11 more
core +1 more source
LSM tree read-deletion operations optimization through the implementation of cuckoo filters
This study aims to develop an LSM tree that uses two different kinds of probabilistic data structures (PDS). These two data structures are the Bloom Filters and the state-of-the-art Cuckoo Filter released in 2014 by Fan.
Humberto Cesar Villalta Valverde +5 more
doaj +1 more source
SERS Facemask for Rapid and Portable Sensing Mycobacterium Tuberculosis Antigens for TB Screening
Our study introduced an Au─Ag embedded covalent organic framework (U@COF) ‐mediated facemask for sensing TB antigen ESAT‐6/CFP‐10 complex in clinical droplet samples toward TB screening. Practical analysis of clinical samples demonstrated the availability of our facemask, which is capable of identifying the TB subjects (N = 17) from healthy candidates (
Lingzhi Chen +20 more
wiley +1 more source
Bloom Filters at Fifty: From Probabilistic Foundations to Modern Engineering and Applications
The Bloom filter remains one of the most influential constructs in probabilistic computation, a structure that achieves a mathematically elegant balance between accuracy, space efficiency, and computational speed.
Paul A. Gagniuc +2 more
doaj +1 more source

