Sciweavers

1279 search results - page 106 / 256
» Fast Implementations of Automata Computations
Sort
View
ICPP
2006
IEEE
14 years 4 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 2 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
EUROSYS
2007
ACM
14 years 7 months ago
Sweeper: a lightweight end-to-end system for defending against fast worms
The vulnerabilities which plague computers cause endless grief to users. Slammer compromised millions of hosts in minutes; a hit-list worm would take under a second. Recently prop...
Joseph Tucek, James Newsome, Shan Lu, Chengdu Huan...
VLDB
2001
ACM
139views Database» more  VLDB 2001»
14 years 2 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
ANCS
2005
ACM
14 years 3 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