62 search results - page 10 / 13 » Approximating Linear Threshold Predicates |
142
Voted
WIOPT
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
134
Voted
TNN
1998
15 years 2 months ago
1998
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
124
Voted
ICIP
2001
IEEE
16 years 4 months ago
2001
IEEE
We describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform [3] and the curvelet transform [7, 6]. Our implementations offer...
126
Voted
JAT
2010
15 years 1 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
129
Voted
COLT
2003
Springer
15 years 8 months ago
2003
Springer
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...