The construction of binary Huffman equivalent codes with a greater number of synchronising codewords

By Huang Yuh-Ming   Wu Sheng-Chi  

International Journal of Ad Hoc and Ubiquitous Computing, Vol. 9, Iss. 1, 2012-02 ,pp. : 54-65

Inderscience Publishers

Access to resources Recommend Favorite

Extended Prefix Hash Trees for a Distributed Phone Book Application

By  

International Journal of Grid and High Performance Computing (IJGHPC), Vol. 1, Iss. 4, 2009-10 ,pp. : 57-69

IGI Global_journal

Access to resources Recommend Favorite

Answering ad hoc aggregate queries from data streams using prefix aggregate trees

By Cho Moonjung   Pei Jian   Wang Ke  

Knowledge and Information Systems, Vol. 12, Iss. 3, 2007-08 ,pp. : 301-329

Springer Publishing Company

Access to resources Recommend Favorite

An effective algorithm for mining closed sequential patterns and their minimal generators based on prefix trees

By Pham Thi-Thiet   Luo Jiawei   Vo Bay  

International Journal of Intelligent Information and Database Systems, Vol. 7, Iss. 4, 2013-09 ,pp. : 324-339

Inderscience Publishers

Access to resources Recommend Favorite

A Free Construction of Dynamic Terms

By Astesiano E.   Zucca E.  

Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. : 143-156

Academic Press

Access to resources Recommend Favorite