Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ASIACRYPT
2011
Springer
9 years 2 months ago
Functional Encryption for Inner Product Predicates from Learning with Errors
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...
Shweta Agrawal, David Mandell Freeman, Vinod Vaiku...
COLT
2010
Springer
10 years 19 days ago
Mansour's Conjecture is True for Random DNF Formulas
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)...
Adam R. Klivans, Homin K. Lee, Andrew Wan
JCSS
2007
85views more  JCSS 2007»
10 years 2 months ago
A general dimension for query learning
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...
José L. Balcázar, Jorge Castro, Davi...
IJCAI
1993
10 years 3 months ago
A New Algorithm for Incremental Prime Implicate Generation
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...
Teow-Hin Ngair
COLT
2006
Springer
10 years 6 months ago
DNF Are Teachable in the Average Case
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...
Homin K. Lee, Rocco A. Servedio, Andrew Wan
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
10 years 6 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, ...
APPROX
2005
Springer
80views Algorithms» more  APPROX 2005»
10 years 8 months ago
On Learning Random DNF Formulas Under the Uniform Distribution
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 ...
Jeffrey C. Jackson, Rocco A. Servedio
ALT
2002
Springer
10 years 11 months ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
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...
Johannes Köbler, Wolfgang Lindner
books