Sciweavers

884 search results - page 137 / 177
» A Proof Theory for DL-Lite
Sort
View
WWW
2007
ACM
16 years 2 months ago
Compiling cryptographic protocols for deployment on the web
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
Jay A. McCarthy, Shriram Krishnamurthi, Joshua D. ...
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
16 years 2 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
16 years 2 months ago
Multi-class cost-sensitive boosting with p-norm loss functions
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...
Aurelie C. Lozano, Naoki Abe
POPL
2008
ACM
16 years 2 months ago
The intensional content of Rice's theorem
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
Andrea Asperti
POPL
2007
ACM
16 years 2 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty