Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Yes-no Bloom filter: A way of representing sets with fewer false
  positives   The Bloom filter (BF) is a space efficient randomized data structure
particularly suitable to represent a set supporting approximate membership
queries. BFs have been extensively used in many applications especially in
networking due to their simplicity and flexibility. The performances of BFs
mainly depends on query overhead, space requirements and false positives. The
aim of this paper is to focus on false positives. Inspired by the recent
application of the BF in a novel multicast forwarding fabric for information
centric networks, this paper proposes the yes-no BF, a new way of representing
a set, based on the BF, but with significantly lower false positives and no
false negatives. Although it requires slightly more processing at the stage of
its formation, it offers the same processing requirements for membership
queries as the BF. After introducing the yes-no BF, we show through
simulations, that it has better false positive performance than the BF.

16
The categories of this paper are: stat
5
The categories of this paper are: gr-qc
29
The categories of this paper are: funct-an
11
The categories of this paper are: hep-lat
32
The categories of this paper are: atom-ph
36
The categories of this paper are: cmp-lg
13
The categories of this paper are: quant-ph
4
The categories of this paper are: cond-mat
3
The categories of this paper are: physics
20
The categories of this paper are: acc-phys
7
The categories of this paper are: hep-th
15
The categories of this paper are: nucl-ex
9
The categories of this paper are: nlin
33
The categories of this paper are: plasm-ph
37
The categories of this paper are: supr-con
22
The categories of this paper are: chao-dyn