Sciweavers

4255 search results - page 16 / 851
» On Learning Boolean Functions
Sort
View
JSW
2007
126views more  JSW 2007»
13 years 7 months ago
Efficient Evaluation of Multiple-Output Boolean Functions in Embedded Software or Firmware
— The paper addresses software and firmware implementation of multiple-output Boolean functions based on cascades of Look-Up Tables (LUTs). A LUT cascade is described as a means ...
Vaclav Dvorak
JACIII
2007
99views more  JACIII 2007»
13 years 7 months ago
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
Guoli Ding, Robert F. Lax, Peter P. Chen, Jianhua ...
JMLR
2002
89views more  JMLR 2002»
13 years 7 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
COCO
2003
Springer
91views Algorithms» more  COCO 2003»
14 years 27 days ago
Extremal properties of polynomial threshold functions
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
Ryan O'Donnell, Rocco A. Servedio
FOCS
2009
IEEE
13 years 5 months ago
Learning and Smoothed Analysis
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua T...