ليث علي عبد الصاحب البلداوي

ABSTRACT Log in to post comments In this paper we consider the problem of storing sequences of symbols in a compressed format, while supporting random access to the symbols without decompression. Although this is a well-studied problem when the data is textual, the kind of sequences we look at are not textual, and we argue that traditional compression methods used in the text algorithms community (such as compressors targeting $k$-th order empirical entropy) do not perform as well on these sequential data, and simpler methods such as Huffman-coding the deltas between sequence elements give better compression performance. We discuss data structures that allow random access to sequence elements that target such measure

ABSTRACT Log in to post comments In this paper we consider the problem of storing sequences of symbols in a compressed format, while supporting random access to the symbols without decompression. Although this is a well-studied problem when the data is textual, the kind of sequences we look at are not textual, and we argue that traditional compression methods used in the text algorithms community (such as compressors targeting $k$-th order empirical entropy) do not perform as well on these sequential data, and simpler methods such as Huffman-coding the deltas between sequence elements give better compression performance. We discuss data structures that allow random access to sequence elements that target such measure

تقديم ورشة عمل في قسم علوم الحاسبات في جامعة ليستر والهدف منها هو ادارة الذاكرة الرئيسية مع مجموعة كبيرة من البيانات وهيكلة البيانات بشكل مقتضب.

ندوة علمية عن كيفية تمثيل البيانات باستخدام Binary decision Diagram وماهي احدث الخوارزميات المستخدمة لذلك بالاضافة الى تاثير استخدام BDD من حيث الوقت والذاكرة. وسيكون موعد الندوة في 9\3\2020 في قسم علوم الحاسبات

في الوقت الحالي متقرع كليا لدارسة الدكتوراة في جامعة ليستر