Nearly Optimal Sparse Fourier TransformWe consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. We show: * An O(k log n)-time randomized algorithm for the case where the input signal has at most k non-zero Fourier coefficients, and * An O(k log n log(n/k))-time randomized algorithm for general input signals. Both algorithms achieve o(n log n) time, and thus improve ov
聴覚障害者による言語媒体の場面に応じた使い分け : 口話・手話・筆談と手話通訳者の有効性 | CiNii Research
バレンシアトラフにおけるリフティング前の下部地殻からの反射波(地球科学の窓) | CiNii Research
物体把持のための三次元物体情報抽出 | CiNii Research
