3007 search results - page 279 / 602 » Linear Functional Fixed-points |
146
click to vote
AE
2005
Springer
15 years 9 months ago
2005
Springer
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
136
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
137
click to vote
AES
2004
Springer
15 years 9 months ago
2004
Springer
This paper is motivated by the design of AES. We consider a broader question of cryptanalysis of block ciphers having very good non-linearity and diffusion. Can we expect anyway, ...
144
Voted
HYBRID
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
149
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Kernel methods provide an efficient mechanism to derive nonlinear algorithms. In classification problems as well as in feature extraction, kernel-based approaches map the original...