4843 search results - page 204 / 969 » The Shortcut Problem - Complexity and Approximation |
110
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
139
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
113
Voted
EUSFLAT
2001
15 years 4 months ago
2001
We argue that fuzzy equivalences, and in particular fuzzy equalities, in general are not suitable to model approximate equality due to the notion of transitivity. Using them for t...
128
click to vote
NECO
2008
15 years 3 months ago
2008
In this paper we show that exponentially deep belief networks [3, 7, 4] can approximate any distribution over binary vectors to arbitrary accuracy, even when the width of each lay...
117
click to vote
IDA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC ...