Sciweavers

239 search results - page 8 / 48
» Blooms
Sort
View
SIGCOMM
2009
ACM
14 years 1 months ago
Hash, don't cache: fast packet forwarding for enterprise edge routers
As forwarding tables and link speeds continue to grow, fast packet forwarding becomes increasingly challenging for enterprise edge routers. Simply building routers with ever large...
Minlan Yu, Jennifer Rexford
PADL
2009
Springer
14 years 8 months ago
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand ...
Ketil Malde, Bryan O'Sullivan
DBISP2P
2003
Springer
100views Database» more  DBISP2P 2003»
14 years 17 days ago
Content-Based Overlay Networks for XML Peers Based on Multi-level Bloom Filters
Peer-to-peer systems are gaining popularity as a means to effectively share huge, massively distributed data collections. In this paper, we consider XML peers, that is, peers that ...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
ISSA
2008
13 years 8 months ago
Bloom's Taxonomy for Information Security Education
The importance of educating organizational end users about their roles and responsibilities towards information security is widely acknowledged. However, many current user educati...
Johan Van Niekerk, Rossouw von Solms
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 8 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...