ASIACRYPT
2011
Springer
12 years 4 months ago
2011
Springer
We propose a lattice-based functional encryption scheme for inner product predicates whose security follows from the difficulty of the learning with errors (LWE) problem. This co...
COLT
2010
Springer
13 years 2 months ago
2010
Springer
In 1994, Y. Mansour conjectured that for every DNF formula on n variables with t terms there exists a polynomial p with tO(log(1/)) non-zero coefficients such that Ex{0,1}n [(p(x)...
JCSS
2007
13 years 4 months ago
2007
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
IJCAI
1993
13 years 5 months ago
1993
Traditional algorithms for prime implicate generation [Quine, 1952; McCluskey, 1956; Tison, 1967; Kean and Tsiknis, 1990; de Kleer, 1992] require the input formulas to be first tr...
COLT
2006
Springer
13 years 8 months ago
2006
Springer
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
STOC
1994
ACM
13 years 8 months ago
1994
ACM
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...
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
Abstract: We study the average-case learnability of DNF formulas in the model of learning from uniformly distributed random examples. We define a natural model of random monotone ...
ALT
2002
Springer
14 years 1 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...