Finding an Optimal Region in One- and Two-Dimensional Arrays

スポンサーリンク

概要

• 論文の詳細を見る

• Given N real weights w?1, w?2, ..., w?N stored in one-dimensional array, we consider the problem for finding an optimal interval I ⊂[1, N]under certain criteria. We shall review efficient algorithms developed for solving such problems under several optimality criteria. This problem can be naturally extended to two-dimensional case. Namely, given a N×N two-dimentional array of N?2 reals, the problem seeks to find a subregion of the array(e.g., rectangular subarray R)that optimizes a certain objective function, We shall also review several algorithms for such problems. We shall also mention applications of these problems to region segmentation in image processing and to data mining.

• 社団法人電子情報通信学会の論文
• 2000-03-25

著者

• Katoh N

  The Department Of Architecture And Architectural System Graduate School Of Engineering Kyoto Univers

• KATOH Naoki

  The Department of Architecture and Architectural System, Graduate School of Engineering, Kyoto Unive

• Katoh N

  Laboratory Of Biochemistry Faculty Of Agriculture And Life Science Hirosaki University:(present Addr

• Katoh Naoki

  The Department Of Architecture And Architectural System Graduate School Of Engineering Kyoto Univers

関連論文

• S-RNases from Self-incompatible and -compatible Apple Cultivars : Purification, Cloning, Enzymic Properties, and Pollen Tube Growth Inhibitory Activity(Biochemistry & Molecular Biology)
• Finding an Optimal Region in One- and Two-Dimensional Arrays

スポンサーリンク