50 search results - page 10 / 10 » Polynomial Vicinity Circuits and Nonlinear Lower Bounds |
EUROCOLT
1997
Springer
13 years 11 months ago
1997
Springer
Most of the work on the Vapnik-Chervonenkis dimension of neural networks has been focused on feedforward networks. However, recurrent networks are also widely used in learning app...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
For short-term forecasting of wind generation, a necessary step is to model the function for the conversion of meteorological variables (mainly wind speed) to power production. Su...
LATIN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...