14 search results - page 3 / 3 » A Memory-Efficient Parallel String Matching Architecture for... |
DATE
2008
IEEE
13 years 11 months ago
2008
IEEE
In many applications string pattern matching is one of the most intensive tasks in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Seque...
IPPS
2009
IEEE
13 years 11 months ago
2009
IEEE
String searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of o...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
Our digital universe is growing, creating exploding amounts of data which need to be searched, protected and filtered. String searching is at the core of the tools we use to curb...
SIGMETRICS
2010
ACM
13 years 9 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...