Publications

Detailed Information

소괄호 묶기 방법을 이용한 희소 행렬 연쇄 곱셈의 최적화 : Optimization of Sparse Matrix Chain Multiplication by using Parenthesizing method

DC Field Value Language
dc.contributor.author김정석-
dc.contributor.author성원용-
dc.date.accessioned2009-08-05T05:48:41Z-
dc.date.available2009-08-05T05:48:41Z-
dc.date.issued2009-07-
dc.identifier.citation대한전자공학회 2009년 하계종합학술대회 2009. 7en
dc.identifier.urihttp://www.ieek.or.kr-
dc.identifier.urihttps://hdl.handle.net/10371/6171-
dc.description.abstractMatrix chain multiplication is an important computational kernel used in many applications such as scientific computation, signal and image processing. In this paper, sparse matrix chain multiplication is optimized by using dynamic programming method. With the proposed method, total execution time is reduced by 33%.en
dc.description.sponsorship이 논문은 지식경제부 출연금으로 ETRI와 시스템반도체산업진흥센터에서 수행한 ITSoC 핵심설계인력양성사업과 교육과학기술부의 재원으로 한국학술진흥재단에서 수행하는 BK21 프로젝트의 지원을 받아 수행된 연구입니다.en
dc.language.isokoen
dc.publisher대한전자공학회 = The Institute of Electronics Engineers of Koreaen
dc.title소괄호 묶기 방법을 이용한 희소 행렬 연쇄 곱셈의 최적화en
dc.title.alternativeOptimization of Sparse Matrix Chain Multiplication by using Parenthesizing methoden
dc.typeConference Paperen
dc.contributor.AlternativeAuthorKim, Jungsuk-
dc.contributor.AlternativeAuthorSung, Wonyong-
Appears in Collections:
Files in This Item:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share