WEKO3
アイテム
Another Optimal Binary Representation of Mosaic Floorplans
https://ipsj.ixsq.nii.ac.jp/records/91774
https://ipsj.ixsq.nii.ac.jp/records/9177496051130-1d2f-4af5-9c85-3cd44d96451d
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-AL13144011.pdf (344.5 kB)
|
Copyright (c) 2013 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | SIG Technical Reports(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2013-05-10 | |||||||
| タイトル | ||||||||
| タイトル | Another Optimal Binary Representation of Mosaic Floorplans | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Another Optimal Binary Representation of Mosaic Floorplans | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||
| 資源タイプ | technical report | |||||||
| 著者所属 | ||||||||
| Department of Electrical Engineering and Computer Science, Iwate University | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science, Gunma University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Electrical Engineering and Computer Science, Iwate University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science, Gunma University | ||||||||
| 著者名 |
Katsuhisa, Yamanaka
× Katsuhisa, Yamanaka
|
|||||||
| 著者名(英) |
Katsuhisa, Yamanaka
× Katsuhisa, Yamanaka
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Recently a compact code of mosaic floorplans with f inner face was proposed by He. The length of the code is 3 f - 3 bits and asymptotically optimal. In this paper we propose a new code of mosaic floorplans with f inner faces including k boundary faces. The length of our code is at most 3 f - k/2 - 1 bits. Hence our code is shorter than or equal to the code by He, except for few small floorplans with k = f ≦ 3. Coding and decoding can be done in O(f) time. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Recently a compact code of mosaic floorplans with f inner face was proposed by He. The length of the code is 3 f - 3 bits and asymptotically optimal. In this paper we propose a new code of mosaic floorplans with f inner faces including k boundary faces. The length of our code is at most 3 f - k/2 - 1 bits. Hence our code is shorter than or equal to the code by He, except for few small floorplans with k = f ≦ 3. Coding and decoding can be done in O(f) time. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN1009593X | |||||||
| 書誌情報 |
研究報告アルゴリズム（AL） 巻 2013-AL-144, 号 11, p. 1-3, 発行日 2013-05-10 |
|||||||
| Notice | ||||||||
| SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
