Sciweavers

3775 search results - page 470 / 755
» The Expression Problem Revisited
Sort
View
AISC
1998
Springer
15 years 11 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 10 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
CCS
2006
ACM
15 years 10 months ago
Safety analysis of usage control authorization models
The usage control (UCON) model was introduced as a unified approach to capture a number of extensions for traditional access control models. While the policy specification flexibi...
Xinwen Zhang, Ravi S. Sandhu, Francesco Parisi-Pre...
FLAIRS
2007
15 years 9 months ago
Handling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
Salem Benferhat, Daniel Le Berre, Karima Sedki
APBC
2008
231views Bioinformatics» more  APBC 2008»
15 years 8 months ago
Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
Francis Y. L. Chin, Henry C. M. Leung, Man-Hung Si...