115 search results - page 10 / 23 » : Compiling problem specifications into SAT |
132
click to vote
LISA
2008
15 years 3 months ago
2008
Signature matching, which includes packet classification and content matching, is the most expensive operation of a signature-based network intrusion detection system (NIDS). In t...
119
click to vote
PLILP
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
112
click to vote
AAAI
2006
15 years 2 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
121
click to vote
CHES
2010
Springer
15 years 2 months ago
2010
Springer
Measurement errors make power analysis attacks difficult to mount when only a single power trace is available: the statistical methods that make DPA attacks so successful are not a...
133
click to vote
AOSD
2008
ACM
15 years 3 months ago
2008
ACM
We propose test-based pointcuts, a novel pointcut mechanism for AspectJ-like aspect-oriented programming languages. The idea behind the test-based pointcuts is to specify join poi...