图 书 馆
通用散列法,完美的散列Lecture 8: Universal Hashing, Perfect Hashing |
|
| 课程网址: | http://videolectures.net/mit6046jf05_leiserson_lec08/ |
| 主讲教师: | Charles E. Leiserson |
| 开课单位: | 麻省理工学院 |
| 开课时间: | 2009-02-10 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | //"Hashing. Today we're going to do some amazing stuff with hashing. And, really, this is such neat stuff, it's amazing. We're going to start by addressing a fundamental weakness of hashing. And that is that for any choice of hash function There exists a bad set of keys that all hash to the same slot. OK. So you pick a hash function. We looked at some that seem to work well in practice, that are easy to put into your code. But whichever one you pick, there's always some bad set of keys. So you can imagine, just to drive this point home a little bit..."// |
| 关 键 词: | 算法导论; 通用散列法; 点积 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-05-22：王淑红(课程编辑志愿者) |
| 阅读次数: | 112 |