2517 search results - page 110 / 504 » Specifying Weak Sets |
152
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
170
click to vote
FSE
1997
Springer
15 years 9 months ago
1997
Springer
Matsui's linear cryptanalysis for iterated block ciphers is generalized to an attack called. This attack exploits a weakness that can be described by an e ective partition-pa...
169
click to vote
COLT
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We develop a new error bound for transductive learning algorithms. The slack term in the new bound is a function of a relaxed notion of transductive stability, which meas...
180
click to vote
ACE
2004
15 years 6 months ago
2004
The Capability Maturity Model and SPICE approach to software process improvement has resulted in a robust system for improving development process capability in the field of softw...
144
click to vote
DBA
2006
15 years 6 months ago
2006
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...