![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Wednesday 19 March 2014, 11:30-12:30
Self-Organising Lists
- đ¤ Speaker: Jossy Sayir, Department of Engineering, University of Cambridge
- đ Date & Time: Wednesday 19 March 2014, 11:30 - 12:30
- đ Venue: SigProC meeting room (Kitchen, 3rd floor of Dept. of Engineering)
Questions? Contact
Jossy Sayir
Abstract
Self organising lists are used in data compression to substitute a source with an unknown alphabet with an ordered monotone non-increasing probability mass function. I will explain how they works, and define a number of properties that we would like to prove about them. I will show which of those properties have been proved and which are still open problems.
Series This talk is part of the Communications Research Group Seminar series.
Included in Lists
- Communications Research Group Seminar
- Information Engineering Division seminar list
- SigProC meeting room (Kitchen, 3rd floor of Dept. of Engineering)
Note: Ex-directory lists are not shown.