Sciweavers

1469 search results - page 99 / 294
» Approximate polynomial decomposition
Sort
View
TCOM
2010
110views more  TCOM 2010»
14 years 8 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
FPL
2010
Springer
104views Hardware» more  FPL 2010»
14 years 8 months ago
Multiplicative Square Root Algorithms for FPGAs
Abstract--Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent computing-oriented FPGAs ...
Florent de Dinechin, Mioara Joldes, Bogdan Pasca, ...
CP
2006
Springer
15 years 1 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter
CORR
2007
Springer
194views Education» more  CORR 2007»
14 years 10 months ago
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
Markus Püschel, José M. F. Moura
CORR
2012
Springer
209views Education» more  CORR 2012»
13 years 5 months ago
Aggregation in Probabilistic Databases via Knowledge Compilation
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
Robert Fink, Larisa Han, Dan Olteanu