Sciweavers

860 search results - page 55 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
CN
2007
90views more  CN 2007»
13 years 7 months ago
SweetBait: Zero-hour worm detection and containment using low- and high-interaction honeypots
As next-generation computer worms may spread within minutes to millions of hosts, protection via human intervention is no longer an option. We discuss the implementation of SweetB...
Georgios Portokalidis, Herbert Bos
VLDB
2004
ACM
112views Database» more  VLDB 2004»
14 years 8 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
14 years 5 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
SIGMOD
2003
ACM
142views Database» more  SIGMOD 2003»
14 years 7 months ago
Winnowing: Local Algorithms for Document Fingerprinting
Digital content is for copying: quotation, revision, plagiarism, and file sharing all create copies. Document fingerprinting is concerned with accurately identifying copying, incl...
Saul Schleimer, Daniel Shawcross Wilkerson, Alexan...
VTS
2003
IEEE
89views Hardware» more  VTS 2003»
14 years 1 months ago
Detecting Intra-Word Faults in Word-Oriented Memories
This paper improves upon the state of the art in testing word oriented memories. It first presents a complete set of fault models for intra-word coupling faults. Then, it establi...
Said Hamdioui, A. J. van de Goor, Mike Rodgers