388 search results - page 59 / 78 » Quantum Lower Bounds by Polynomials |
EUROCOLT
1997
Springer
14 years 29 days 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
2007
IEEE
14 years 20 days ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
ISSAC
1997
Springer
14 years 28 days ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
ISTCS
1993
Springer
14 years 26 days ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...