Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...
Abstract. It is an undeniable fact that people want information. Unfortunately, even in today's highly automated society, a lot of the information we desire is still manually ...
Y. F. Dong, Salil S. Kanhere, Chun Tung Chou, Niru...
Abstract. Segmentation is an important step to obtain quantitative information from tomographic data sets. To this end, global thresholding is often used in practice. However, it i...
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...