Sciweavers

1004 search results - page 46 / 201
» Product representations of polynomials
Sort
View
JSCIC
2008
62views more  JSCIC 2008»
13 years 8 months ago
Robustness of a Spline Element Method with Constraints
The spline element method with constraints is a discretization method where the unknowns are expanded as polynomials on each element and Lagrange multipliers are used to enforce th...
Gerard Awanou
TCOM
2010
110views more  TCOM 2010»
13 years 6 months ago
Joint data QR-detection and Kalman estimation for OFDM time-varying Rayleigh channel complex gains
—This paper deals with the case of a high speed mobile receiver operating in an orthogonal-frequency-divisionmultiplexing (OFDM) communication system. Assuming the knowledge of d...
Hussein Hijazi, Laurent Ros
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 11 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
CC
2008
Springer
133views System Software» more  CC 2008»
13 years 8 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets
SIAMMAX
2010
104views more  SIAMMAX 2010»
13 years 3 months ago
The Legendre-Fenchel Conjugate of the Product of Two Positive Definite Quadratic Forms
It is well-known that the Legendre-Fenchel conjugate of a positive definite quadratic form can be explicitly expressed as another positive definite quadratic form, and that the con...
Yun-Bin Zhao