2766 search results - page 183 / 554 » Algorithms for trigonometric polynomials |
236
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
127
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
140
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm fo...
142
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
194
Voted
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...