1773 search results - page 2 / 355 » The Visibility-Voronoi Complex and Its Applications |
FAW
2009
Springer
13 years 10 months ago
2009
Springer
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...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
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 , ...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
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...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
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...
ICIP
2001
IEEE
14 years 6 months ago
2001
IEEE
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...