Sciweavers

127 search results - page 18 / 26
» Measuring the Hardness of SAT Instances
Sort
View
IJAR
2010
91views more  IJAR 2010»
13 years 5 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
CCS
2006
ACM
13 years 11 months ago
Evading network anomaly detection systems: formal reasoning and practical techniques
Attackers often try to evade an intrusion detection system (IDS) when launching their attacks. There have been several published studies in evasion attacks, some with available to...
Prahlad Fogla, Wenke Lee
CSL
2010
Springer
13 years 8 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
13 years 11 months ago
Fair watermarking techniques
Many intellectual property protection (IPP) techniques have been proposed. Their primary objectives are providing convincible proof of authorship with least degradation of the qua...
Gang Qu, Jennifer L. Wong, Miodrag Potkonjak
ICML
2005
IEEE
14 years 8 months ago
A new Mallows distance based metric for comparing clusterings
Despite of the large number of algorithms developed for clustering, the study on comparing clustering results is limited. In this paper, we propose a measure for comparing cluster...
Ding Zhou, Jia Li, Hongyuan Zha