- Author:
- Eric Kidd
A generic function is similar to an overloaded operator, but provides a way to select an appropriate behavior at run-time instead of compile-time. Dujardin and colleagues have proposed an algorithm for building and compressing generic function dispatch tables. We present several modifications to their algorithm, including an improvement to Pseudo-Closest-Poles and two new algorithms for compressing pole tables. The two new compression algorithms are simple and fast, and one produces smaller output than the original.
Cited By
Mehnert H Extending Dylan's type system for better type inference and error detection Proceedings of the 2010 international conference on Lisp, (1-10)- Muschevici R, Potanin A, Tempero E and Noble J Multiple dispatch in practice Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications, (563-582)
- Muschevici R, Potanin A, Tempero E and Noble J (2008). Multiple dispatch in practice, ACM SIGPLAN Notices, 43:10, (563-582), Online publication date: 27-Oct-2008.
- Zibin Y and Gil J Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (142-160)
- Zibin Y and Gil J (2019). Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching, ACM SIGPLAN Notices, 37:11, (142-160), Online publication date: 17-Nov-2002.
Recommendations
Lossless Compression Using Efficient Encoding of Bitmasks
ISVLSI '09: Proceedings of the 2009 IEEE Computer Society Annual Symposium on VLSILossless compression is widely used to improve both memory requirement and communication bandwidth in embedded systems. Dictionary based compression techniques are very popular because of their good compression efficiency and fast decompression ...
Very efficient variable-length codes for the lossless compression of VQ indices
In this paper, we propose a novel compression method that can efficiently compress a vector quantization (VQ) index table. Before compressing the VQ index table, the method sorts all of the codewords in the VQ codebook by principal component analysis (...
Improvement of VQ Index Compression with Relative Index Tables
ICCSIT '08: Proceedings of the 2008 International Conference on Computer Science and Information TechnologyImage Vector Quantization (VQ) has many current applications, like speech and image compression, and envisioned applications, such as digital watermarking, data hiding and speaker identification. In this paper, we propose a novel lossless compression ...