Sciweavers

877 search results - page 161 / 176
» How to Cover a Grammar
Sort
View
TAMC
2007
Springer
14 years 1 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
INFOCOM
2006
IEEE
14 years 1 months ago
Design and Evaluation of a Fast and Robust Worm Detection Algorithm
— Fast spreading worms are a reality, as amply demonstrated by worms such as Slammer, which reached its peak propagation in a matter of minutes. With these kinds of fast spreadin...
Tian Bu, Aiyou Chen, Scott A. Vander Wiel, Thomas ...
MOBICOM
2006
ACM
14 years 1 months ago
Stochastic event capture using mobile sensors subject to a quality metric
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
Nabhendra Bisnik, Alhussein A. Abouzeid, Volkan Is...
SAC
2006
ACM
14 years 1 months ago
Semantic analysis of web site audience
With the emergence of the World Wide Web, analyzing and improving Web communication has become essential to adapt the Web content to the visitors’ expectations. Web communicatio...
Jean-Pierre Norguet, Esteban Zimányi, Ralf ...
DSN
2005
IEEE
14 years 1 months ago
The Effects of Algorithmic Diversity on Anomaly Detector Performance
Common practice in anomaly-based intrusion detection assumes that one size fits all: a single anomaly detector should detect all anomalies. Compensation for any performance short...
Kymie M. C. Tan, Roy A. Maxion