Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Hu, Yu-Chen | Chang, Chin-Chen
Affiliations: Department of Computer Science and Information Engineering Providence University Shalu 433, Taichung, Taiwan, R.O.C. E-mail: ychu@pu.edu.tw | Department of Information Engineering and Computer Science Feng Chia University Taichung 407, Taiwan, R.O.C. E-mail: ccc@cs.ccu.edu.tw
Abstract: In this paper, an improved tree-structured codebook search algorithm is proposed. It is called the two-level codebook search algorithm (TLCS). The goal of this method is to reduce the computation cost of the multi-path-searching algorithm for TSVQ. It speeds up the codebook search by searching only a two-level codebook tree instead of the whole TSVQ codebook tree. According to the experimental results, a significant time reduction can be achieved with this method, compared to the multi-path-searching algorithm. In other words, our TLCS outperforms the multi-path-searching algorithm.
Journal: Fundamenta Informaticae, vol. 70, no. 3, pp. 251-260, 2006
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl