Sciweavers

785 search results - page 13 / 157

» The Dynamic Bloom Filters

9

GLOBECOM
2008
IEEE

87views Communications» more GLOBECOM 2008»

A Throughput-Efficient Packet Classifier with n Bloom filters

14 years 2 months ago

A Throughput-Efficient Packet Classifier with n Bloom filters

Download cial.csie.ncku.edu.tw

Heeyeol Yu, Rabi N. Mahapatra

claim paper

Read More »

18

INFOCOM
2008
IEEE

105views Communications» more INFOCOM 2008»

A Memory-Efficient Hashing by Multi-Predicate Bloom Filters for Packet Classification

14 years 1 months ago

A Memory-Efficient Hashing by Multi-Predicate Bloom Filters for Packet Classification

Download cial.csie.ncku.edu.tw

Heeyeol Yu, Rabi N. Mahapatra

claim paper

Read More »

13

ICC
2007
IEEE

70views Communications» more ICC 2007»

Mesh Network Firewalling with Bloom Filters

14 years 1 months ago

Mesh Network Firewalling with Bloom Filters

Download www.prism.uvsq.fr

Leonardo Maccari, Romano Fantacci, Pablo Neira Ayu...

claim paper

Read More »

18

IPCCC
2007
IEEE

103views Communications» more IPCCC 2007»

A Power Management Proxy with a New Best-of-N Bloom Filter Design to Reduce False Positives

14 years 1 months ago

A Power Management Proxy with a New Best-of-N Bloom Filter Design to Reduce False Positives

Download www.csee.usf.edu

Miguel Jimeno, Kenneth J. Christensen, Allen Rogin...

claim paper

Read More »

22

WAW
2007
Springer

77views Algorithms» more WAW 2007»

Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms

14 years 1 months ago

Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms

Download research.microsoft.com

Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...

Sreenivas Gollapudi, Marc Najork, Rina Panigrahy

claim paper

Read More »

« Prev « First page 13 / 157 Last » Next »