• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Development of Algorithmic Paradigms on Memory-Constrained Computation

Research Project

Project/Area Number 23300001
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Research Field Fundamental theory of informatics
Research InstitutionJapan Advanced Institute of Science and Technology

Principal Investigator

ASANO Tetsuo  北陸先端科学技術大学院大学, 学長 (90113133)

Co-Investigator(Kenkyū-buntansha) UEHARA Ryuhei  北陸先端科学技術大学院大学, 情報科学研究科, 教授 (00256471)
OTACHI Yota  北陸先端科学技術大学院大学, 情報科学研究科, 助教 (80610196)
Project Period (FY) 2011-04-01 – 2015-03-31
Project Status Completed (Fiscal Year 2014)
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)
Keywordsアルゴリズム / 省メモリアルゴリズム / 計算幾何学 / グラフ理論 / 画像処理 / 深さ優先探索 / アルゴリズム設計 / トレードオフ / 直近上位要素発見問題 / 最短経路発見問題 / 省メモリ / 作業領域 / 計算複雑度
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.

Report

(5 results)
  • 2014 Annual Research Report   Final Research Report ( PDF )
  • 2013 Annual Research Report
  • 2012 Annual Research Report
  • 2011 Annual Research Report
  • Research Products

    (20 results)

All 2014 2013 2012 2011

All Journal Article (10 results) (of which Peer Reviewed: 10 results) Presentation (10 results)

  • [Journal Article] Memory-constrained algorithms for simple polygons2013

    • Author(s)
      Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Gunter Rote, Andre Schulz
    • Journal Title

      Comput. Geom.

      Volume: 46(8) Issue: 8 Pages: 959-969

    • DOI

      10.1016/j.comgeo.2013.04.005

    • Related Report
      2013 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Small-Space Algorithm for Removing Small Connected Components from a Binary Image2013

    • Author(s)
      Tetsuo Asano, Revant Kumar
    • Journal Title

      IEICE Transactions

      Volume: 96-A(6) Pages: 1044-1050

    • NAID

      10031193788

    • Related Report
      2013 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Reporting All Segment Intersections Using an Arbitrary Sized Work Space2013

    • Author(s)
      Matsuo Konagaya, Tetsuo Asano
    • Journal Title

      IEICE Transactions

      Volume: 96ーA(6) Pages: 1066-1071

    • NAID

      10031193791

    • Related Report
      2013 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Algorithm for Reporting All Segment Intersections Using Work Space of Arbitrary Size2012

    • Author(s)
      Matsuo Konagaya
    • Journal Title

      IEICE Trans. EA

      Volume: 1 Pages: 1-1

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Small-Space Algorithm for Removing Small Connected Components from a Binary Image2012

    • Author(s)
      Tetsuo Asano
    • Journal Title

      IEICE Trans. EA

      Volume: 1 Pages: 1-1

    • NAID

      10031193788

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] NP-completeness of generalized Kaboozle2012

    • Author(s)
      Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
    • Journal Title

      Journal of Information Processing

      Volume: 20 Issue: 3 Pages: 713-718

    • DOI

      10.2197/ipsjjip.20.713

    • NAID

      130002116381

    • ISSN
      1882-6652
    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks2012

    • Author(s)
      Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
    • Journal Title

      Information Sciences

      Volume: 197 Pages: 77-90

    • DOI

      10.1016/j.ins.2012.01.038

    • NAID

      120003184350

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] In-place Algorithm for Erasing a Connected Component in a Binary Image2012

    • Author(s)
      Tetsuo Asano
    • Journal Title

      Theory of Computing Systems

      Volume: 50(1) Issue: 1 Pages: 111-123

    • DOI

      10.1007/s00224-011-9335-6

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] In-place Algorithm for Erasing a Connected Component in a Binary Image2012

    • Author(s)
      T.Asano
    • Journal Title

      Theory of Computing

      Volume: 50 Pages: 111-123

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Constant-Work-Space Algorithms for Geometric Problems2011

    • Author(s)
      T.Asano, 他3名
    • Journal Title

      J.of Computational Geometry

      Volume: 2 Pages: 46-68

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Presentation] Depth-First Search Using O(n) Bits2014

    • Author(s)
      T. Asano, T. Izumi, M. Kiyomi, M. Konagaya, H. Ono, Y. Otachi, P. Schweitzer, J. Tarui, R. Uehara
    • Organizer
      The 25th International Symposium on Algorithms and Computation
    • Place of Presentation
      Jeonju, Korea
    • Year and Date
      2014-12-17
    • Related Report
      2014 Annual Research Report
  • [Presentation] O(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability2014

    • Author(s)
      T. Asano, D.G. Kirkpatrick, K. Nakagawa, O. Watanabe
    • Organizer
      39th International Symposium on Mathematical Foundation of Computer Science
    • Place of Presentation
      Budapest, Hungary
    • Year and Date
      2014-08-25
    • Related Report
      2014 Annual Research Report
  • [Presentation] Priority Queues and Sorting for Read-Only Data2013

    • Author(s)
      Tetsuo Asano, Amr Elmasry, Jyrki Katajainen
    • Organizer
      TAMC
    • Place of Presentation
      Hong Kong, China
    • Related Report
      2013 Annual Research Report
  • [Presentation] Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems2013

    • Author(s)
      Tetsuo Asano, David G. Kirkpatrick
    • Organizer
      WADS
    • Place of Presentation
      London, Canada
    • Related Report
      2013 Annual Research Report
  • [Presentation] Memory-Constrained Algorithms for Simple Polygons2012

    • Author(s)
      T.Asano, 他6名
    • Organizer
      European Workshop on Computational Geometry
    • Place of Presentation
      アッシジ,イタリア
    • Year and Date
      2012-03-22
    • Related Report
      2011 Annual Research Report
  • [Presentation] A New Framework for Connected Components Labeling of Binary Images2012

    • Author(s)
      Tetsuo Asano
    • Organizer
      15th International Workshop on Combinatorial Image Analysis
    • Place of Presentation
      Austin, USA
    • Related Report
      2012 Annual Research Report
  • [Presentation] Small Work Space Algorithms for Some Basic Problems on Binary Images2012

    • Author(s)
      Tetsuo Asano
    • Organizer
      15th International Workshop on Combinatorial Image Analysis
    • Place of Presentation
      Austin, USA
    • Related Report
      2012 Annual Research Report
  • [Presentation] Memory-Constrained Algorithms for Shortest Path Problem2011

    • Author(s)
      T.Asano, B.Doerr
    • Organizer
      Canadian Conference on Computational Geometry
    • Place of Presentation
      トロント,カナダ
    • Year and Date
      2011-08-11
    • Related Report
      2011 Annual Research Report
  • [Presentation] Nearest Larger Neighbors Problem and Memory-Constrained Algorithms2011

    • Author(s)
      T.Asano
    • Organizer
      International Workshop on Combinatorial Algorithms
    • Place of Presentation
      ビクトリア,カナダ(招待講演)
    • Year and Date
      2011-06-21
    • Related Report
      2011 Annual Research Report
  • [Presentation] Designing Algorithms with Limited Work Space2011

    • Author(s)
      T.Asano
    • Organizer
      8th Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      調布,日本(招待講演)
    • Year and Date
      2011-05-23
    • Related Report
      2011 Annual Research Report

URL: 

Published: 2011-04-06   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi