Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
Localization and classification of acoustic signals in a complex auditory scene is an every day task of the human auditory system. However, this problem presents a significant c...
All of the existing N-point discrete fractional signal transforms require O(N2 ) computation complexity. In this paper, we propose a new discrete fractional signal transform whose...
Various image restoration methods have been studied for removing space-variant motion blur such as iterative and POCS method. However, their computational complexity of the method...