This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
As large main memory becomes more and more available at reasonable prices, processing speed of large data sets becomes more important than reducing main memory usage of internal d...
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...