Results 41 to 50 of about 120,737 (284)
A Case for Partitioned Bloom Filters
IEEE Transactions on Computers, 2023 In a partitioned Bloom Filter the $m$ bit vector is split into $k$ disjoint $m/k$ sized parts, one per hash function. Contrary to hardware designs, where they prevail, software implementations mostly adopt standard Bloom filters, considering partitioned filters slightly worse, due to the slightly larger false positive rate (FPR).
openaire +3 more sources
Combine multi-dimension Bloom filter for membership queries
Tongxin xuebao, 2008 Based on the analysis of multi-dimension Bloom filter（MDBF） presented before, a combine multi-dimension Bloom filter（CMBE） was presented. CMDBF adds a combine Bloom filter （CBF） to MDBF to assist in representing the whole element.
XIE Kun1 +4 more
doaj +2 more sources
, 2006 A Bloom filter is a simple randomized data structure that answers membership query with no false negative and a small false positive probability. It is an elegant data compression technique for membership information, and has broad applications.
Bruck, Jehoshua +2 more
core
Idempotent distributed counters using a Forgetful Bloom Filter [PDF]
, 2015 Distributed key-value stores power the backend of high-performance web services and cloud computing applications. Key-value stores such as Cassandra rely heavily on counters to keep track of the occurrences of various kinds of events.
Subramanyam, Rajath
core +1 more source
Biomass Native Structure Into Functional Carbon‐Based Catalysts for Fenton‐Like Reactions
Advanced Functional Materials, EarlyView.This study indicates that eight biomasses with 2D flaky and 1D acicular structures influence surface O types, morphology, defects, N doping, sp2 C, and Co nanoparticles loading in three series of carbon, N‐doped carbon, and cobalt/graphitic carbon. This work identifies how these structural factors impact catalytic pathways, enhancing selective electron
Wenjie Tian +7 more
wiley +1 more source
Set reconciliation based on counting Bloom filters
Tongxin xuebao, 2012 A new set reconciliation algorithm was presented,which called counting-Bloom-filter based set reconciliation(CBFSR).This method represented sets SA and SB as counting Bloom filters,subtracts SA's counting Bloom filter from SB's counting Bloom filter,the ...
Xiao-mei TIAN +5 more
doaj +2 more sources
A Bloom filter based semi-index on $q$-grams [PDF]
, 2015 We present a simple $q$-gram based semi-index, which allows to look for a pattern typically only in a small fraction of text blocks. Several space-time tradeoffs are presented.
Grabowski, Szymon +2 more
core +1 more source
Parallel 3D Bioprinting on SLIPS‐Microarrays
Advanced Functional Materials, EarlyView.This work introduces the first truly parallel 3D bioprinting method, enabling both the simultaneous fabrication of hundreds of cell laden hydrogel 3D structures and their HTS in individual liquid compartments. By integrating Digital Light Processing (DLP) stereolithography with functional micropatterns, the platform decouples printing time from array ...
Julius von Padberg +3 more
wiley +1 more source
Route Prefix Caching Using Bloom Filters in Named Data Networking
Applied Sciences, 2020 This paper proposes an elaborate route prefix caching scheme for fast packet forwarding in named data networking (NDN) which is a next-generation Internet structure.
Junghwan Kim +3 more
doaj +1 more source
Increasing the power efficiency of Bloom filters for network string matching [PDF]
, 2006 Although software based techniques are widely accepted in computer security systems, there is a growing interest to utilize hardware opportunities in order to compensate for the network bandwidth increases.
Kaya, I, Kocak, T
core +2 more sources