Sciweavers

32 search results - page 3 / 7
» Polynomial Interpolation of the Discrete Logarithm
Sort
View
SIAMSC
2010
134views more  SIAMSC 2010»
13 years 4 months ago
Moving Least Squares via Orthogonal Polynomials
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient ...
Michael Carley
ICASSP
2011
IEEE
12 years 9 months ago
Interpolation based on stationary and adaptive AR(1) modeling
In this paper, we describe a minimal mean square error (MMSE) optimal interpolation filter for discrete random signals. We explicitly derive the interpolation filter for a firs...
Eija Johansson, Marie Strom, Mats Viberg, Lennart ...
PODC
2004
ACM
13 years 11 months ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi
CORR
2007
Springer
173views Education» more  CORR 2007»
13 years 5 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
JCB
2006
91views more  JCB 2006»
13 years 5 months ago
Reverse Engineering Discrete Dynamical Systems from Data Sets with Random Input Vectors
Recently a new algorithm for reverse engineering of biochemical networks was developed by Laubenbacher and Stigler. It is based on methods from computational algebra and finds mos...
Winfried Just