Sciweavers

7167 search results - page 535 / 1434
» Answer Set Programming
Sort
View
JIS
2006
105views more  JIS 2006»
15 years 4 months ago
Automated support specification for efficient mining of interesting association rules
In recent years, the weakness of the canonical support-confidence framework for associations mining has been widely studied. One of the difficulties in applying association rules ...
Wen-Yang Lin, Ming-Cheng Tseng
IGPL
1998
97views more  IGPL 1998»
15 years 4 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
LATINCRYPT
2010
15 years 3 months ago
On the Impossibility of Batch Update for Cryptographic Accumulators
Abstract. A cryptographic accumulator is a scheme where a set of elements is represented by a single short value. This value, along with another value called witness, allows to pro...
Philippe Camacho, Alejandro Hevia
JMLR
2010
104views more  JMLR 2010»
14 years 11 months ago
Learnability, Stability and Uniform Convergence
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
Shai Shalev-Shwartz, Ohad Shamir, Nathan Srebro, K...
157
Voted
ICFP
2006
ACM
16 years 4 months ago
Access control in a core calculus of dependency
The Dependency Core Calculus (DCC) is an extension of the computational lambda calculus that was designed in order to capture the notion of dependency that arises in information-f...
Martín Abadi