Finding the minimum number of elements with sum above a threshold

DOI10.1016/J.INS.2013.02.035MaRDI QIDQ497136zbMATH OpenOpenAlexFDO

Authors Yong-Cai Geng, Sumit K. Garg

Publication date 23 September 2015

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2013.02.035

zbMATH Keywords

data compressiondata representationHaar waveletselection algorithm

Mathematics Subject Classification ID

Numerical methods for wavelets (65T60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Algorithms and Computation
• scientific article; zbMATH DE number 1054953
• The threshold of compression in wavelet transform with Haar’s coefficients - numerical examples
• Computing unrestricted synopses under maximum error bound
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

Cites work

• scientific article; zbMATH DE number 1629859 (Why is no real title available?)
• Comparison-based time-space lower bounds for selection
• Computing unrestricted synopses under maximum error bound
• Dominating sets in directed graphs
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Time bounds for selection

Cited in

(1)

• Optimum nonnegative integer bit allocation for wavelet based signal compression and coding

This page was built for publication: Finding the minimum number of elements with sum above a threshold

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