Results 201 to 210 of about 12,077 (255)
wholeskim: Utilising Genome Skims for Taxonomically Annotating Ancient DNA Metagenomes. [PDF]
Mol Ecol ResourElliott L +5 more
europepmc +1 more source
Unexpected microbial rhodopsin dynamics in sync with phytoplankton blooms. [PDF]
Nat CommunGómez-Consarnau L +9 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Ternary Bloom Filter Replacing Counting Bloom Filter
IEEE Communications Letters, 2017A 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 +3 more
openaire +1 more source
Ternary Bloom filter replacing counting Bloom filter
2016 IEEE International Conference on Consumer Electronics-Asia (ICCE-Asia), 2016A counting Bloom filter (CBF) generalizes a standard 1-bit vector Bloom filter and allows not only membership queries but also insertion and deletion operations for dynamic sets. However, the CBF can cause false negatives because of counter overflows. A 4-bit vector CBF, which provides the probability of false negatives sufficiently small, is generally
Hayoung Byun, Jungwon Lee, Hyesook Lim
openaire +1 more source
IEEE/ACM Transactions on Networking, 2001
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, for many applications the space savings outweigh this draw-back when the probability of an error is sufficiently low.
openaire +1 more source
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, for many applications the space savings outweigh this draw-back when the probability of an error is sufficiently low.
openaire +1 more source
ACM SIGCOMM Computer Communication Review, 2006
Many networking applications require fast state lookups in a concurrent state machine,which tracks the state of a large number of flows simultaneously.We consider the question of how to compactly represent such concurrent state machines. To achieve compactness,we consider data structures for Approximate Concurrent State Machines (ACSMs)that can return ...
Flavio Bonomi +4 more
openaire +1 more source
Many networking applications require fast state lookups in a concurrent state machine,which tracks the state of a large number of flows simultaneously.We consider the question of how to compactly represent such concurrent state machines. To achieve compactness,we consider data structures for Approximate Concurrent State Machines (ACSMs)that can return ...
Flavio Bonomi +4 more
openaire +1 more source
2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications, 2008
A bloom filter is a randomized data structure for performing approximate membership queries. It is being increasingly used in networking applications ranging from security to routing in peer to peer networks. In order to meet a given false positive rate, the amount of memory required by a bloom filter is a function of the number of elements in the set.
F. Hao, M. Kodialam, T. V. Lakshman
openaire +1 more source
A bloom filter is a randomized data structure for performing approximate membership queries. It is being increasingly used in networking applications ranging from security to routing in peer to peer networks. In order to meet a given false positive rate, the amount of memory required by a bloom filter is a function of the number of elements in the set.
F. Hao, M. Kodialam, T. V. Lakshman
openaire +1 more source
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, Yossi Matias
openaire +1 more source
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, Yossi Matias
openaire +1 more source
Proceedings of the 2017 VI International Conference on Network, Communication and Computing, 2017
A standard technique from the cryptanalysis is to use exhaustive search that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the hash value. But this will take a lot of storage space and the time spent on query will be very long.
Yuanhang Yang, Shuhui Chen
openaire +1 more source
A standard technique from the cryptanalysis is to use exhaustive search that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the hash value. But this will take a lot of storage space and the time spent on query will be very long.
Yuanhang Yang, Shuhui Chen
openaire +1 more source