|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9184
|
| タイトル: | Online Uniformity of Integer Points on a Line |
| 著者: | Asano, Tetsuo |
| キーワード: | Algorithm
Uniformity
Discrepancy |
| 発行日: | 2008-09-10 |
| 出版者: | Elsevier |
| 誌名: | information Processing Letters |
| 巻: | 109 |
| 号: | 1 |
| 開始ページ: | 57 |
| 終了ページ: | 60 |
| DOI: | 10.1016/j.ipl.2008.09.008 |
| 抄録: | This Letter presents algorithms for computing a uniform sequence of n integer points in a given interval [0,m] where m and n are integers such that m>n>0. The uniformity of a point set is measured by the ratio of the minimum gap over the maximum gap. We prove that we can insert n integral points one by one into the interval [0,m] while keeping the uniformity of the point set at least 1/2. If we require uniformity strictly greater than 1/2, such a sequence does not always exist, but we can prove a tight upper bound on the length of the sequence for given values of n and m. |
| Rights: | NOTICE: This is the author’s version of a work accepted for publication by Elsevier. Changes resulting from the publishing process, including peer review, editing, corrections, structural formatting and other quality control mechanisms, may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Tetsuo Asano, information Processing Letters, 109(1), 2008, 57-60, http://dx.doi.org/10.1016/j.ipl.2008.09.008 |
| URI: | http://hdl.handle.net/10119/9184 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 14490.pdf | | 200Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
