Finding the minimum number of elements with sum above a threshold
Author(s)
Jiang, Yan
Pang, Chaoyi
Zhang, Hao Lan
Wang, Junhu
Li, Tongliang
Zhang, Qing
He, Jing
Griffith University Author(s)
Year published
2013
Metadata
Show full item recordAbstract
Motivated by the wavelet compression techniques and their applications, we consider the following problem: Given an unsorted array of numerical values and a threshold, what is the minimum number of elements chosen from the array, such that the sum of these elements is not less than the threshold value. In this article, we first provide two linear time algorithms for the problem. We then demonstrate the efficacy of these algorithms through experiments. Lastly, as an application of this research, we indicate that the construction of wavelet synopses on a prescribed error bound (in L2 metric) can be solved in linear time.Motivated by the wavelet compression techniques and their applications, we consider the following problem: Given an unsorted array of numerical values and a threshold, what is the minimum number of elements chosen from the array, such that the sum of these elements is not less than the threshold value. In this article, we first provide two linear time algorithms for the problem. We then demonstrate the efficacy of these algorithms through experiments. Lastly, as an application of this research, we indicate that the construction of wavelet synopses on a prescribed error bound (in L2 metric) can be solved in linear time.
View less >
View less >
Journal Title
Information Sciences
Volume
238
Subject
Mathematical sciences
Information and computing sciences
Database systems
Engineering