Sciweavers

10 search results - page 1 / 2
» Bloom Filters in Probabilistic Verification
Sort
View
FMCAD
2004
Springer
13 years 8 months ago
Bloom Filters in Probabilistic Verification
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
Peter C. Dillinger, Panagiotis Manolios
DPD
2010
153views more  DPD 2010»
13 years 1 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
CJ
2002
67views more  CJ 2002»
13 years 4 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
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 ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
IWNAS
2006
IEEE
13 years 10 months ago
Hint-based Routing in WSNs using Scope Decay Bloom Filters
— In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or do...
Xiuqi Li, Jie Wu, Jun (Jim) Xu
CLUSTER
2004
IEEE
13 years 8 months ago
Hierarchical Bloom filter arrays (HBA): a novel, scalable metadata management system for large cluster-based storage
An efficient and distributed scheme for file mapping or file lookup scheme is critical in decentralizing metadata management within a group of metadata servers. This paper present...
Yifeng Zhu, Hong Jiang, Jun Wang