Sciweavers

COCO
2006
Springer
96views Algorithms» more  COCO 2006»
13 years 8 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman