29908 search results - page 83 / 5982 » On the Complexity of |
LICS
2006
IEEE
14 years 4 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
IWANN
2005
Springer
14 years 3 months ago
2005
Springer
The generalization ability of different sizes architectures with one and two hidden layers trained with backpropagation combined with early stopping have been analyzed. The depend...
ATAL
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We describe an analytic approach, multiscale analysis, that can demonstrate the fundamental limitations of decomposition based engineering for the development of highly c...
ATAL
2004
Springer
14 years 3 months ago
2004
Springer
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...