An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters

DOI10.1007/978-3-642-40450-4_6MaRDI QIDQ2849297zbMATH OpenOpenAlexFDO

Authors Lars Arge, Gerth Stølting Brodal, Jakob Truelsen, Constantinos P. Tsirogiannis

Publication date 17 September 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40450-4_6

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1728267
• Optimal cache usage for separable image processing algorithms on general purpose workstations
• A class of multi-resolution approximations for large spatial datasets
• An efficient raster evaluation method for univariate polynomials
• scientific article; zbMATH DE number 1755588
• Adaptive multiresolution methods: practical issues on data structures, implementation and parallelization
• Cache optimization for structured and unstructured grid multigrid
• A faster algorithm to estimate multiresolution densities

Cited in

(2)

• Optimal cache usage for separable image processing algorithms on general purpose workstations
• Cache oblivious algorithms for computing the triplet distance between trees

This page was built for publication: An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters

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