A New Data Structure for Cumulative Frequency Tables
نویسنده
چکیده
A new method (the ‘binary indexed tree’) is presented for maintaining the cumulative frequencies which are needed to support dynamic arithmetic data compression. It is based on a decomposition of the cumulative frequencies into portions which parallel the binary representation of the index of the table element (or symbol). The operations to traverse the data structure are based on the binary coding of the index. In comparison with previous methods, the binary indexed tree is faster, using more compact data and simpler code. The access time for all operations is either constant or proportional to the logarithm of the table size. In conjunction with the compact data structure, this makes the new method particularly suitable for large symbol alphabets.
منابع مشابه
\self-organized Language Modeling for Speech Recognition". In
\A new data structure for cumulative probability tables". Soft-\The zero-frequency problem: estimating the probabilities of novel events in adaptive text compression".
متن کامل\self-organized Language Modeling for Speech Recognition". In
\A new data structure for cumulative probability tables". Soft-\The zero-frequency problem: estimating the probabilities of novel events in adaptive text compression".
متن کاملA New Data Structure for Cumulative Probability Tables: An Improved Frequency-to-Symbol Algorithm
متن کامل
Implementing a Novel Data Structure for Maintaining Cumulative Frequency of Symbols
A new data structure, namely “cumulative frequency matrix (CFM)”, is proposed here for maintaining cumulative frequencies. For an order-0 model having 256 symbols, CFM is a 2-D array of 16 rows and 16 columns. Two nibbles, say L for left and R for right, of a byte symbol represents row and column dimensions respectively. Matrix element (L, R) represents cumulative frequency of symbol with right...
متن کاملA New Hybrid Method for Web Pages Ranking in Search Engines
There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Softw., Pract. Exper.
دوره 24 شماره
صفحات -
تاریخ انتشار 1994