Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
205
click to vote
TSP
2010
168
views
Artificial Intelligence
»
more
TSP 2010
»
Barankin-type lower bound on multiple change-point estimation
15 years 2 months ago
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
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)
Researcher Info
TSP 2008 Study Group
Computer Vision