Sciweavers

318 search results - page 40 / 64
» Learning to Construct Fast Signal Processing Implementations
Sort
View
ICASSP
2011
IEEE
14 years 5 months ago
New radix-based FHT algorithm for computing the discrete Hartley transform
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
Monir Taha Hamood, Said Boussakta
IJON
2002
98views more  IJON 2002»
15 years 1 months ago
Blind deconvolution by simple adaptive activation function neuron
The `Bussgang' algorithm is one among the most known blind deconvolution techniques in the adaptive signal processing literature. It relies on a Bayesian estimator of the sou...
Simone Fiori
TSD
2004
Springer
15 years 7 months ago
Handling Multi-word Expressions Without Explicit Linguistic Rules in an MT System
Abstract. Translation of Multi-word expressions (MWEs) is one of the most challenging tasks of a Machine translation (MT) system. In this paper, we present an innovative technique ...
Akshar Bharati, Rajeev Sangal, Dipti Mishra, Srira...
ICA
2007
Springer
15 years 5 months ago
Conjugate Gamma Markov Random Fields for Modelling Nonstationary Sources
In modelling nonstationary sources, one possible strategy is to define a latent process of strictly positive variables to model variations in second order statistics of the underly...
Ali Taylan Cemgil, Onur Dikmen
AIED
2007
Springer
15 years 8 months ago
Helping Courseware Authors to Build Ontologies: The Case of TM4L
The authors of topic map-based learning resources face major difficulties in constructing the underlying ontologies. In this paper we propose two approaches to address this problem...
Darina Dicheva, Christo Dichev