239 search results - page 6 / 48 » Blooms |
STEP
2003
IEEE
14 years 18 days ago
2003
IEEE
This paper is the product of a workshop held in Amsterdam during the Software Technology and Practice Conference (STEP 2003). The purpose of the paper is to propose Bloom’s taxo...
IPL
2007
13 years 7 months ago
2007
Bloom Filters provide space-efficient storage of sets at the cost of a probability of false positives on membership queries. The size of the filter must be defined a priori bas...
CJ
2002
13 years 7 months ago
2002
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
KDD
2003
ACM
14 years 7 months ago
2003
ACM
MICRO
2007
IEEE
14 years 1 months ago
2007
IEEE
Transactional Memory (TM) systems must track the read and write sets—items read and written during a transaction—to detect conflicts among concurrent transactions. Several TM...