| Budget Amount *help |
¥18,200,000 (Direct Cost: ¥14,000,000、Indirect Cost: ¥4,200,000)
Fiscal Year 2014: ¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2013: ¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2012: ¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2011: ¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
|
|---|
| Outline of Final Research Achievements |
With recent progressin computer environment,as the performance of computers is improved, people tend to be interested in larger-sized problems such as big-data processing. The problem size is continuously growing, we have a problem of too large memory size to be included in computer main memory. Because of this reason memory-constrained algorithms are requested in many ways, but research on small-memory algorithms has just begun. In this reserch we focus on computational geometry and develop memory-efficient algorithms,but we also developed efficient algorithms for graph problems and binary image processing problems.
|
