|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2008-11-18 13:50 |
Fukuoka |
Kitakyushu Science and Research Park |
A Novel Network Optimization Method using On-Chip Virtual Network on Dynamically Reconfigurable Processor DAPDNA-2 Shan Gao, Taku Kihara, Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka (Keio University), Kosuke Shiba (IPFlex Inc) RECONF2008-51 |
[more] |
RECONF2008-51 pp.69-74 |
RECONF, CPSY, VLD, IPSJ-SLDM |
2008-01-16 17:25 |
Kanagawa |
Hiyoshi Campus, Keio University |
Fast solution method of Set Cover Problem on parallel reconfigurable processor DAPDNA-2 Hiroyuki Ishikawa, Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka (Keio Univ.), Kosuke Shiba (IPFlex) VLD2007-116 CPSY2007-59 RECONF2007-62 |
This paper proposes a fast calculation method of the set cover problem, which is implemented on reconfigurable processor... [more] |
VLD2007-116 CPSY2007-59 RECONF2007-62 pp.67-72 |
IN, NS (Joint) |
2006-03-02 09:50 |
Okinawa |
Rizzan Sea-Park Hotel Tancha-Bay (Okinawa) |
Shortest path algorithm on parallel reconfigurable processor DAPDNA Hiroyuki Ishikawa, Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka (Keio Univ.), Kosuke Shiba (IPFlex) |
[more] |
NS2005-162 pp.17-20 |
RECONF |
2005-11-30 16:10 |
Fukuoka |
Kitakyushu International Conference Center |
Implementation of 1-D/2-D FFT on the Dynamically Reconfigurable Processor DAPDNA-2 Kosuke Shiba, Atsushi Imaizumi, Takeshi Sakuma (IPFlex) |
The Fast Fourier Transform (FFT), which is applied to extensive fields as a basic technology of various digital signal p... [more] |
RECONF2005-56 pp.19-24 |
RECONF |
2005-12-01 09:30 |
Fukuoka |
Kitakyushu International Conference Center |
A Study on Shortest Path Routing Algorithm on Reconfigurable Processor Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka (Keio Univ.), Kosuke Shiba (IPFlex) |
n IP networks, we ordinally use OSPF(Open Shortest Path First) as a routing protocol. OSPF find the shortest path using ... [more] |
RECONF2005-59 pp.1-6 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|