Finding the minimum number of elements with sum above a threshold

DOI10.1016/J.INS.2013.02.035zbMath1320.68073OpenAlexW2094952576MaRDI QIDQ497136

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 compressionHaar waveletdata representationselection 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)

Related Items (1)

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

Cites Work

• Unnamed Item
• Dominating sets in directed graphs
• Time bounds for selection
• Computing unrestricted synopses under maximum error bound
• Comparison-based time-space lower bounds for selection
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

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