209 search results - page 8 / 42 » The Computational Complexity of Weak Saddles |
ECOOPW
1999
Springer
13 years 11 months ago
1999
Springer
Impact analysis is seen as an important technique for controlling the evolution of software systems. Numerous approaches have been proposed which aim to assess the impact of chang...
JMLR
2012
11 years 10 months ago
2012
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
AAAI
1990
13 years 8 months ago
1990
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...