Results 241 to 250 of about 13,604 (287)

Influence of trace metal additions on the longevity of algal blooms across a productivity gradient. [PDF]

J Phycol
Gladfelter MF, Bela IG, Wilson AE.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the analysis of Bloom filters

Information Processing Letters, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fabio Grandi
exaly   +4 more sources

The Dynamic Bloom Filters

IEEE Transactions on Knowledge and Data Engineering, 2010
A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter and its variants just focus on how to represent a static set and decrease the false positive probability to a sufficiently low level.
Deke Guo, Jie Wu, Ye Yuan
exaly   +2 more sources

Fast Bloom Filters and Their Generalization

IEEE Transactions on Parallel and Distributed Systems, 2014
Bloom filters have been extensively applied in many network functions. Their performance is judged by three criteria: query overhead, space requirement, and false positive ratio. Due to wide applicability, any improvement to the performance of Bloom filters can potentially have a broad impact in many areas of networking research.
Yan Qiao, Shigang Chen
exaly   +2 more sources

Receiver-oriented design of Bloom filters for data-centric routing

Computer Networks, 2010
Bloom filter (BF) is a space-efficient data structure that represents a large set of items and supports efficient membership queries. It has been widely proposed to employ Bloom filters in the routing entries so as to facilitate data-centric routing in ...
Deke Guo, Yuan He, Panlong Yang
exaly   +2 more sources

A Distributed Event-Based System based on Compressed Fragmented-Iterated Bloom Filters

Future Generation Computer Systems, 2017
In this research, we propose the construction of a new architecture of Fragmented-Iterated Bloom Filters to redirect events of a distributed event-based system.
Pierre Leone
exaly   +2 more sources

Ternary Bloom Filter Replacing Counting Bloom Filter

IEEE Communications Letters, 2017
A counting Bloom filter (CBF) is commonly used in many applications for the membership queries of dynamic data since the CBF can provide delete operations. A CBF uses an array of $c$ -bit counters. The $c$ should be large enough to avoid overflows.
Hyesook Lim, Jungwon Lee, Ha Young Byun, Changhoon Yim   +3 more
openaire   +1 more source

Weighted Bloom Filter

2006 IEEE International Symposium on Information Theory, 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. In this paper, we generalize the traditional Bloom filter to Weighted Bloom Filter, which incorporates the ...
Jehoshua Bruck, Jie Gao 0001, Anxiao Jiang   +2 more
openaire   +1 more source

Spectral bloom filters

Proceedings of the 2003 ACM SIGMOD international conference on Management of data, 2003
A Bloom Filter is a space-efficient randomized data structure allowing membership queries over sets with certain allowable errors. It is widely used in many applications which take advantage of its ability to compactly represent a set, and filter out effectively any element that does not belong to the set, with small error probability.
Saar Cohen 0002, Yossi Matias
openaire   +1 more source