2766 search results - page 360 / 554 » Algorithms for trigonometric polynomials |
153
Voted
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
138
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
109
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
119
click to vote
LCTRTS
2004
Springer
15 years 10 months ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
169
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
This paper is addressing the problem of realigning broken
objects without correspondences. We consider linear transformations between
the object fragments and present the method ...