209 search results - page 35 / 42 » The Computational Complexity of Weak Saddles |
UML
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Current trends in software development show a move towards supporting autonomous components (agents). The accurate timing of interactions between such components is growi...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
EMMCVPR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The complexity of visual representations is substantially limited by the compositional nature of our visual world which, therefore, renders learning structured object mod...
NIPS
2000
13 years 8 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...