Sciweavers

1677 search results - page 247 / 336
» On the Completeness of Quantum Computation Models
Sort
View
CCS
2004
ACM
15 years 7 months ago
Testing network-based intrusion detection signatures using mutant exploits
Misuse-based intrusion detection systems rely on models of attacks to identify the manifestation of intrusive behavior. Therefore, the ability of these systems to reliably detect ...
Giovanni Vigna, William K. Robertson, Davide Balza...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 5 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
TIFS
2008
157views more  TIFS 2008»
15 years 1 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
TSE
2002
105views more  TSE 2002»
15 years 1 months ago
Disaggregating and Calibrating the CASE Tool Variable in COCOMO II
CASE (Computer Aided Software Engineering) tools are believed to have played a critical role in improving software productivity and quality by assisting tasks in software developme...
Jongmoon Baik, Barry W. Boehm, Bert Steece
153
Voted
CORR
2009
Springer
242views Education» more  CORR 2009»
14 years 11 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...