图 书 馆
竞争性亲密度测试Competitive Closeness Testing |
|
| 课程网址: | http://videolectures.net/colt2011_das_testing/ |
| 主讲教师: | Hirakendu Das |
| 开课单位: | 加州大学圣地亚哥分校 |
| 开课时间: | 2011-08-02 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | We test whether two sequences are generated by the same distribution or by two diff erent ones. Unlike previous work, we make no assumptions on the distributions' support size. Additionally, we compare our performance to that of the best possible test. We describe an efficiently-computable algorithm based on pattern maximum likelihood that is near optimal whenever the best possible error probability is < exp(-14n2/3) using length-n sequences. |
| 关 键 词: | 算法; 概率; 序列 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-03-05：lxf |
| 阅读次数: | 57 |