5964 search results - page 1153 / 1193 » A theory of speculative computation |
114
click to vote
EUROCOLT
1997
Springer
15 years 4 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...
115
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
141
click to vote
COLT
1993
Springer
15 years 4 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
188
click to vote
STOC
1993
ACM
15 years 4 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
101
click to vote
CTRS
1990
15 years 4 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...