2766 search results - page 258 / 554 » Algorithms for trigonometric polynomials |
164
click to vote
EPIA
1993
Springer
15 years 9 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
139
click to vote
STOC
1993
ACM
15 years 9 months ago
1993
ACM
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
131
click to vote
COMPGEOM
1989
ACM
15 years 9 months ago
1989
ACM
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...
133
Voted
AAECC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Commutative semifields in odd characteristic can be equivalently described by planar functions (also known as PN functions). We describe a method to construct a semifield...
151
click to vote
FCCM
2004
IEEE
15 years 9 months ago
2004
IEEE
We propose a parallel architecture for implementing the interpolation step in the Koetter-Vardy soft-decision ReedSolomon decoding algorithm. The key feature is the embedding of b...