Sciweavers

1418 search results - page 61 / 284
» Schema polynomials and applications
Sort
View
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
15 years 5 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
15 years 4 months ago
Polynomial datapath optimization using constraint solving and formal modelling
For a variety of signal processing applications polynomials are implemented in circuits. Recent work on polynomial datapath optimization achieved significant reductions of hardware...
Finn Haedicke, Bijan Alizadeh, Görschwin Fey,...
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 6 months ago
Computing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
16 years 13 days ago
Interference Detection in Spread Spectrum Communication Using Polynomial Phase Transform
—In this paper we propose an interference detection technique for detecting time varying jamming signals in spread spectrum communication systems. The technique is based on Discr...
Randa Zarifeh, Nandini Alinier, Sridhar Krishnan, ...
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 6 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung