2938 search results - page 107 / 588 » On obfuscating point functions |
165
click to vote
EUROCAST
1997
Springer
15 years 10 months ago
1997
Springer
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...
111
click to vote
MOC
2002
15 years 6 months ago
2002
We consider finite element operators defined on "rough" functions in a bounded polyhedron in RN . Insisting on preserving positivity in the approximations, we discover a...
165
click to vote
LPAR
2005
Springer
15 years 12 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
172
click to vote
AAAI
2012
13 years 8 months ago
2012
In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distri...
175
click to vote
JOTA
2011
15 years 1 months ago
2011
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...