|
|
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 # |
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 |
PN |
2007-08-10 11:20 |
Toyama |
Kureha-Haitsu, Toyama |
High-speed Resource Information Advertising Method in GMPLS Masahiro Nishida, Hiroyuki Ishikawa, Sho Shimizu, Yutaka Arakawa, Satoru Okamoto, Naoaki Yamanaka (Keio Univ.) PN2007-15 |
As a broadband communication service extends rapidly, it is very difficult to estimate the increase and fluctuation of t... [more] |
PN2007-15 pp.33-38 |
PN |
2006-03-17 14:15 |
Okinawa |
|
Prefetching Protocol Proxy with Optimal Mirror Selection and BurstTransmission Tomohiro Tsuji, Junichiro Honma, Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka (Keio Univ.) |
Prefetching is one of the most effective ways to reduce a Web access delay. In this paper, we shorten a download time by... [more] |
PN2005-119 pp.115-119 |
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 |
IN, NS (Joint) |
2006-03-02 10:40 |
Okinawa |
Rizzan Sea-Park Hotel Tancha-Bay (Okinawa) |
Overlay Networks Based on User Preferences in Peer-to-Peer System Masahiro Tateno, Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka (Keio Univ.) |
In this paper, we propose overlay network architecture and the contents search method considering with user preference. ... [more] |
IN2005-180 pp.143-146 |
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 |
NS, IN |
2005-03-04 13:50 |
Okinawa |
Okinawa Zanpa-misaki Royal |
A Wavelength Assignment Scheme for WDM Network with Limited Range Wavelength Converters Sho Shimizu, Takanori Ito, Yutaka Arakawa, Naoaki Yamanaka (Keio Univ.) |
In the wavelength-routed network, the blocking probability can be improved by using wavelength converters because they e... [more] |
NS2004-311 IN2004-311 pp.329-332 |
|
|
|
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]
|