期刊
INVERSE PROBLEMS
卷 38, 期 3, 页码 -出版社
IOP Publishing Ltd
DOI: 10.1088/1361-6420/ac3c16
关键词
curse of dimensionality; frequency estimation; runtime complexity; sparse Fourier transform
In this paper, a new hashing scheme is theoretically proposed for the sparse Fourier transform in high-dimensional space. The complexity analysis of the algorithm shows that this transform can overcome the curse of dimensionality. To the best of our knowledge, this is the first polynomial-time algorithm to recover high-dimensional continuous frequencies.
In this paper, we theoretically propose a new hashing scheme to establish the sparse Fourier transform in high-dimensional space. The estimation of the algorithm complexity shows that this sparse Fourier transform can overcome the curse of dimensionality. To the best of our knowledge, this is the first polynomial-time algorithm to recover the high-dimensional continuous frequencies.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据