Sciweavers

106 search results - page 6 / 22
» The Laguerre-Sobolev-type orthogonal polynomials
Sort
View
CAEPIA
2003
Springer
14 years 18 days ago
Generating Random Orthogonal Polygons
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
Ana Paula Tomás, António Leslie Baju...
CORR
2007
Springer
107views Education» more  CORR 2007»
13 years 7 months ago
Bounds on ordered codes and orthogonal arrays
— We prove several new bounds on ordered codes and ordered orthogonal arrays. We also show that the eigenvalues of the ordered Hamming scheme are the multivariable Krawtchouk pol...
Alexander Barg, Punarbasu Purkayastha
JSCIC
2008
59views more  JSCIC 2008»
13 years 7 months ago
Computing Derivatives of Noisy Signals Using Orthogonal Functions Expansions
In many applications noisy signals are measured. These signals has to be filtered and, sometimes, their derivative have to be computed. In this paper a method for filtering the si...
Adi Ditkowski, Abhinav Bhandari, Brian W. Sheldon
PR
2007
248views more  PR 2007»
13 years 6 months ago
A numerical recipe for accurate image reconstruction from discrete orthogonal moments
Recursive procedures used for sequential calculations of polynomial basis coefficients in discrete orthogonal moments produce unreliable results for high moment orders as a resul...
Bulent Bayraktar, Tytus Bernas, J. Paul Robinson, ...
AISC
2010
Springer
14 years 5 days ago
On Krawtchouk Transforms
Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus fo...
Philip Feinsilver, René Schott