Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

TSP
2010

favoriteEmaildiscussreport

168views Artificial Intelligence» more TSP 2010»

Barankin-type lower bound on multiple change-point estimation

12 years 11 months ago

Barankin-type lower bound on multiple change-point estimation

Download web1.lss.supelec.fr

We compute lower bounds on the mean-square error of multiple change-point estimation. In this context, the parameters are discrete and the Cram

Patricio S. La Rosa, Alexandre Renaux, Carlos H. M

Real-time Traffic

Artificial Intelligence | Compute | Lower Bound | Parameters | TSP 2010 |

claim paper

Related Content

» Tightness of capacity bounds in correlated MIMO systems with channel estimation error

» Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity

» Cramer Rao bound on target localization estimation in MIMO radar systems

» MultipleAccess Insights from Bounds on Sensor Localization

» Entropy of Operators or why Matrix Multiplication is Hard for DepthTwo Circuits

» Fast full search block motion estimation for H264AVC with multilevel successive eliminatio...

» Transmit Energy Focusing for DOA Estimation in MIMO Radar with Colocated Antennas

» Blind Estimation of Multiple Carrier Frequency Offsets

» Optimality analysis of sensortarget localization geometries

Post Info
More Details (n/a)

Added	22 May 2011
Updated	22 May 2011
Type	Journal
Year	2010
Where	TSP
Authors	Patricio S. La Rosa, Alexandre Renaux, Carlos H. Muravchik, Arye Nehorai

Comments (0)