کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
393020 | 665549 | 2013 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Finding the minimum number of elements with sum above a threshold
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Finding the minimum number of elements with sum above a threshold Finding the minimum number of elements with sum above a threshold](/preview/png/393020.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 238, 20 July 2013, Pages 205–211
Journal: Information Sciences - Volume 238, 20 July 2013, Pages 205–211
نویسندگان
Yan Jiang, Chaoyi Pang, Hao Lan Zhang, Junhu Wang, Tongliang Li, Qing Zhang, Jing He,