8 search results - page 1 / 2 » Fast Conversion Algorithms for Orthogonal Polynomials |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduc...
ICIP
2007
IEEE
13 years 11 months ago
2007
IEEE
In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named H2O, is easy to...
DAC
2011
ACM
12 years 4 months ago
2011
ACM
Stochastic device noise has become a significant challenge for high-precision analog/RF circuits, and it is particularly difficult to correctly include both white noise and flic...
ICIP
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper presents a novel hybrid approach that combines state of the art fitting algorithms: algebraic-based and geometric-based. It consists of two steps; first, the 3L algorit...
FOCM
2008
13 years 4 months ago
2008
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...