Sciweavers

1380 search results - page 47 / 276
» A General Polynomial Sieve
Sort
View
TIT
2010
98views Education» more  TIT 2010»
13 years 3 months ago
QR decomposition of Laurent polynomial matrices sampled on the unit circle
Abstract--We consider Laurent polynomial (LP) matrices defined on the unit circle of the complex plane. QR decomposition of an LP matrix A(s) yields QR factors Q(s) and R(s) that, ...
Davide Cescato, Helmut Bölcskei
ICASSP
2011
IEEE
13 years 13 days ago
Smoothing fir filtering of discrete state-space polynomial signal models
A smoothing finite impulse response (FIR) filter is addressed for discrete time-invariant state-space polynomial models commonly used to model signals over finite data. A gener...
Oscar Gerardo Ibarra-Manzano, Yuriy S. Shmaliy, Lu...
JACM
2000
119views more  JACM 2000»
13 years 8 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
JC
2000
138views more  JC 2000»
13 years 8 months ago
Multivariate Polynomials, Duality, and Structured Matrices
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
Bernard Mourrain, Victor Y. Pan
STACS
2009
Springer
14 years 3 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...