On Approximate Maximum-Likelihood Methods for Blind Identification: How to Cope With the Curse of Dimensionality

DOI10.1109/TSP.2009.2024283zbMath1391.94494OpenAlexW1990193860MaRDI QIDQ4569951

Steffen Barembruch, Aurélien Garivier, Eric Moulines

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2009.2024283

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Related Items (4)

Approximate posterior distributions for convolutional two-level hidden Markov models ⋮ Sequential Monte Carlo smoothing for general state space hidden Markov models ⋮ Unnamed Item ⋮ Particle filters for partially-observed Boolean dynamical systems

This page was built for publication: On Approximate Maximum-Likelihood Methods for Blind Identification: How to Cope With the Curse of Dimensionality