Reconstructing curves in three (and higher) dimensional space from noisy data
From MaRDI portal
Publication:3581291
DOI10.1145/780542.780563zbMath1192.94039OpenAlexW1968162029MaRDI QIDQ3581291
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780563
Numerical smoothing, curve fitting (65D10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (3)
Decoding interleaved Reed-Solomon codes over noisy channels ⋮ Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions
This page was built for publication: Reconstructing curves in three (and higher) dimensional space from noisy data
