126 search results - page 2 / 26 » Improved Approximation of Linear Threshold Functions |
ICASSP
2008
IEEE
14 years 6 days ago
2008
IEEE
In this paper, we extend the cross-multiplicative transfer function (CMTF) approach for improved system identification in the shorttime Fourier transform (STFT) domain. The propo...
COCO
2003
Springer
13 years 11 months ago
2003
Springer
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 ...
FSTTCS
2003
Springer
13 years 11 months ago
2003
Springer
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
COLT
1993
Springer
13 years 10 months ago
1993
Springer
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...