Result 1 to 10 of 10 total
Sparse weighted voting classifier selection and its linear programming relaxations. (English)
Inf. Process. Lett. 112, No. 12, 481-486 (2012).
1
Hardness of reconstructing multivariate polynomials over finite fields. (English)
SIAM J. Comput. 39, No. 6, 2598-2621 (2010).
2
Optimal cryptographic hardness of learning monotone functions. (English)
Theory Comput. 5, Paper No. 13, 257-282, electronic only (2009).
3
Hardness of learning halfspaces with noise. (English)
SIAM J. Comput. 39, No. 2, 742-765 (2009).
4
Efficient learning algorithms yield circuit lower bounds. (English)
J. Comput. Syst. Sci. 75, No. 1, 27-36 (2009).
5
Hardness of approximate two-level logic minimization and PAC learning with membership queries. (English)
J. Comput. Syst. Sci. 75, No. 1, 13-26 (2009).
6
Cryptographic hardness for learning intersections of halfspaces. (English)
J. Comput. Syst. Sci. 75, No. 1, 2-12 (2009).
7
The complexity of properly learning simple concept classes. (English)
J. Comput. Syst. Sci. 74, No. 1, 16-34 (2008).
8
On the complexity of learning lexicographic strategies. (English)
J. Mach. Learn. Res. 7, 55-83 (2006).
9
On the optimization of fuzzy decision trees. (English)
Fuzzy Sets Syst. 112, No. 1, 117-125 (2000).
10
Result 1 to 10 of 10 total
Start
Contact
Print
General Help
