Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
In this paper we study the arithmetic complexity of computing the pth Kronecker power of an n × n matrix. We first analyze a straightforward inductive computation which requires an asymptotic average of p multiplications and p - 1 additions per computed output. We then apply efficient methods for matrix multiplication to obtain an algorithm that achieves the optimal rate of one multiplication per output at the expense of increasing the number of additions, and an algorithm that requires O(log p) multiplications and O(log2p) additions per output. © 1983.
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998