Approximation of function evaluation over sequence arguments via specialized data structures

DOI10.1016/J.TCS.2015.03.049MaRDI QIDQ897968zbMATH OpenOpenAlexFDO

Authors Tamal T. Biswas, Kenneth W. Regan

Publication date 8 December 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.03.049

zbMATH Keywords

machine learningtopologydata structuressequencescloud computingmetricsmemoization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20) Data structures (68P05) Database theory (68P15) Tables in numerical analysis (65A99) Functions of several variables (26B99)

Recommendations

• Efficient memoization for approximate function evaluation over sequence arguments
• Sequential function approximation with noisy data
• Approaches to expedite function computation on dense grids
• Multiple point evaluation on combined tensor product supports
• Complexity of functions: Some questions, conjectures, and results

Cites work

• scientific article; zbMATH DE number 1998962 (Why is no real title available?)
• Data streams: algorithms and applications.
• Efficient memo-table management strategies

Cited in

(4)

• Denseness of volatile and nonvolatile sequences of functions
• A Note on the Space Complexity of Fast D-Finite Function Evaluation
• Efficient memoization for approximate function evaluation over sequence arguments
• scientific article; zbMATH DE number 1805762 (Why is no real title available?)

This page was built for publication: Approximation of function evaluation over sequence arguments via specialized data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897968)