Sciweavers

414 search results - page 23 / 83
» On discrete norms of polynomials
Sort
View
JCB
2006
91views more  JCB 2006»
13 years 10 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
MOC
2002
86views more  MOC 2002»
13 years 9 months ago
Hermite interpolation of nonsmooth functions preserving boundary conditions
Abstract. This article is devoted to the construction of a Hermite-type regularization operator transforming functions that are not necessarily C1 into globally C1 finite-element f...
V. Girault, L. R. Scott
SIAMSC
2010
134views more  SIAMSC 2010»
13 years 8 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
2009
IEEE
14 years 4 months ago
Minimax design of adjustable FIR filters using 2D polynomial methods
The problem under study here is the minimax design of linearphase lowpass FIR filters having variable passband width and implemented through a Farrow structure. We have two main ...
Bogdan Dumitrescu, Bogdan C. Sicleru, Radu Stefan
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
13 years 11 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...