2766 search results - page 242 / 554 » Algorithms for trigonometric polynomials |
DAGSTUHL
2006
15 years 6 months ago
2006
Abstract. We propose a new algorithm for the computation of the minimal associated primes of an ideal. In [1] we have introduced modifications to an algorithm for the computation o...
140
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
134
click to vote
TOMS
2008
15 years 5 months ago
2008
We introduce three fast contouring algorithms for visualizing the solution of Partial Differential Equations based on the PCI (Pure Cubic Interpolant). The PCI is a particular pie...
162
click to vote
CAL
2002
15 years 5 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
153
click to vote
SIAMDM
2000
15 years 5 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...