Density Finding on a Rectangle
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 97 === We define the density finding problem on a rectangle(DFR for short) as follows. Given an m-by-n rectangle R, each unit block is attached with a value and a weight. A subrectangle S in R is an m′-by-n′ rectangle where 1 <= m′ <= m and 1 <= n′ <= n....
Main Author: | 羅偉力 |
---|---|
Other Authors: | 蔡錫鈞 |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/33560090739466877692 |
Similar Items
-
Finding a largest empty rectangle
by: ZHANG, HUI-RONG, et al.
Published: (1985) -
Efficient Classification Using Density-Based Hyper-Rectangle Covers
by: Ping-Fang Chiang, et al.
Published: (2012) -
The higher spin rectangle
by: Menika Sharma
Published: (2018-01-01) -
Chronological rectangle digraphs
by: Manzer, Joshua Daniel Adrian
Published: (2015) -
Decomposing rectilinear regions into rectangles
by: Chadha, Ritu
Published: (2019)