Sciweavers

785 search results - page 20 / 157
» The Dynamic Bloom Filters
Sort
View
ISAAC
1994
Springer
91views Algorithms» more  ISAAC 1994»
13 years 11 months ago
A New Problem in String Searching
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...
George Havas, Jin Xian Lian
ANCS
2005
ACM
14 years 1 months ago
Fast and scalable pattern matching for content filtering
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
Sarang Dharmapurikar, John W. Lockwood
HIPEAC
2007
Springer
14 years 1 months ago
Applying Decay to Reduce Dynamic Power in Set-Associative Caches
Abstract. In this paper, we propose a novel approach to reduce dynamic power in set-associative caches that leverages on a leakage-saving proposal, namely Cache Decay. We thus open...
Georgios Keramidas, Polychronis Xekalakis, Stefano...
CJ
2004
99views more  CJ 2004»
13 years 7 months ago
Filters for XML-based Service Discovery in Pervasive Computing
Pervasive computing refers to an emerging trend towards numerous casually accessible devices connected to an increasingly ubiquitous network infrastructure. An important challenge...
Georgia Koloniari, Evaggelia Pitoura
IJSN
2007
106views more  IJSN 2007»
13 years 7 months ago
Hash-AV: fast virus signature scanning by cache-resident filters
Abstract— Fast virus scanning is becoming increasingly important in today’s Internet. While Moore’s law continues to double CPU cycle speed, virus scanning applications fail ...
Ozgun Erdogan, Pei Cao