1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013
First-Come-First-Served for Online Slot Allocation and Huffman Coding
Monik Khare, Claire Mathieu, Neal E. Young
Can one choose a good Huffman code on the fly, without knowing the underlying distribution? Online Slot Allocation (OSA) models this and similar problems: There are n slots, each w…
cs.DS2012★ 1 cited
Caching with rental cost and zapping
Monik Khare, Neal E. Young
The \emph{file caching} problem is defined as follows. Given a cache of size (a positive integer), the goal is to minimize the total retrieval cost for the given sequence of re…