2766 search results - page 259 / 554 » Algorithms for trigonometric polynomials |
146
click to vote
EUROGP
2008
Springer
15 years 7 months ago
2008
Springer
We present N-gram GP, an estimation of distribution algorithm for the evolution of linear computer programs. The algorithm learns and samples the joint probability distribution of...
157
click to vote
IPCO
2007
15 years 7 months ago
2007
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
169
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
142
click to vote
AAECC
2007
Springer
15 years 5 months ago
2007
Springer
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
150
click to vote
AAECC
2007
Springer
15 years 5 months ago
2007
Springer
We discuss parametrizations of filter coefficients of scaling functions and compactly supported orthonormal wavelets with several vanishing moments. We introduce the first discr...