I/O-Efficient minimizing range sum = 영역 합 최소화를 위한 외부 메모리 알고리즘

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 409
  • Download : 0
Given a set P of N objects in a region Q in 2-dimensional space and a rectangle r, the Minimizing Range Sum(MinRS) problem is to find an optimal location of the rectangle r that minimizes the sum of weights of objects covered by r. Each object corresponds to a non-negative weighted point and the size of a rectangle r is fixed. There already exists an in-memory algorithm which is not enough to adapt to a scalable environment. In this paper, we show that the MinRS problem returns a solution in the lower bound in terms of I/O costs. We also propose the All Minimizing Range Sum(AllMinRS) problem, which is to find all optimal locations. We prove how many optimal locations can exist at most in a given region Q, which implies the I/O complexity of the AllMinRS problem.
Advisors
Choi, Sung-Heeresearcher최성희
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
2014
Identifier
569323/325007  / 020123135
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학과, 2014.2, [ iii, 26 p. ]

Keywords

Algorithm; 계산 기하학; I/O 복잡도; 외부 메모리; 알고리즘; Computational Geometry; External memory; I/O Complexity

URI
http://hdl.handle.net/10203/196895
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=569323&flag=dissertation
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0