Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Amir Zandieh"'
Autor:
Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc0638c0192243ebe3b235be3d40c256
https://doi.org/10.1137/1.9781611977554.ch177
https://doi.org/10.1137/1.9781611977554.ch177
We propose an algorithm for robust recovery of the spherical harmonic expansion of functions defined on the d-dimensional unit sphere $\mathbb{S}^{d-1}$ using a near-optimal number of function evaluations. We show that for any $f \in L^2(\mathbb{S}^{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79d1751d8909137764aae620bb15b426
Publikováno v:
STOC
The problem of approximately computing the $k$ dominant Fourier coefficients of a vector $X$ quickly, and using few samples in time domain, is known as the Sparse Fourier Transform (sparse FFT) problem. A long line of work on the sparse FFT has resul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8756ef103732a814e0ad08eb06f79546
http://arxiv.org/abs/1702.01286
http://arxiv.org/abs/1702.01286
Autor:
Amir Zandieh
Publikováno v:
Amir Zandieh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2063d8dc9fadeae5b7a0ffd0b2a30f95
http://papers.nips.cc/paper/9648-efficiently-learning-fourier-sparse-set-functions.pdf
http://papers.nips.cc/paper/9648-efficiently-learning-fourier-sparse-set-functions.pdf