Sciweavers

2766 search results - page 71 / 554
» Algorithms for trigonometric polynomials
Sort
View
73
Voted
TSP
2008
74views more  TSP 2008»
15 years 19 days ago
Performance of ESPRIT for Estimating Mixtures of Complex Exponentials Modulated by Polynomials
High Resolution (HR) methods are known to provide accurate frequency estimates for discrete spectra. The Polynomial Amplitude Complex Exponentials (PACE) model, also called quasipo...
Roland Badeau, Gaël Richard, Bertrand David
117
Voted
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
14 years 10 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
CODCRY
2011
Springer
247views Cryptology» more  CODCRY 2011»
14 years 4 months ago
List Decoding for Binary Goppa Codes
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...
Daniel J. Bernstein
109
Voted
ICANN
2005
Springer
15 years 6 months ago
Robust Structural Modeling and Outlier Detection with GMDH-Type Polynomial Neural Networks
Abstract. The paper presents a new version of a GMDH type algorithm able to perform an automatic model structure synthesis, robust model parameter estimation and model validation i...
Tatyana I. Aksenova, Vladimir Volkovich, Alessandr...
66
Voted
ECCC
2010
86views more  ECCC 2010»
15 years 25 days ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...