Efficient memoization for approximate function evaluation over sequence arguments

DOI10.1007/978-3-319-07956-1_17MaRDI QIDQ5251644zbMATH OpenOpenAlexFDO

Authors Tamal T. Biswas, Kenneth W. Regan

Publication date 20 May 2015

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07956-1_17

zbMATH Keywords

cloud computingdata structuresmachine learningmemoizationmetricssequencestopology

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Approximation of function evaluation over sequence arguments via specialized data structures
• Sequential function approximation with noisy data
• Complexity of functions: Some questions, conjectures, and results
• Approaches to expedite function computation on dense grids
• scientific article; zbMATH DE number 903737

Cited in

(1)

• Approximation of function evaluation over sequence arguments via specialized data structures

This page was built for publication: Efficient memoization for approximate function evaluation over sequence arguments

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