IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 22  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
CAS, ICTSSL 2019-01-24
15:50
Tokyo Kikai-Shinko-Kaikan Bldg. A Facility Location Algorithm based on k-means/k-means++ Clustering
Ryoji Tanemura, Toshihiko Takahashi (Niigata Univ.) CAS2018-126 ICTSSL2018-45
We propose a heuristic algorithm for metric uncapacitated facility location problem with uniform opening costs, which is... [more] CAS2018-126 ICTSSL2018-45
pp.49-52
CAS, SIP, MSS, VLD 2018-06-15
08:40
Hokkaido Hokkaido Univ. (Frontier Research in Applied Sciences Build.) Efficient inspection routes of expressway facilities
Toshihiko Takahashi (Niigata Univ.), Kousuke Maruta (Canon Imaging Systems) CAS2018-17 VLD2018-20 SIP2018-37 MSS2018-17
 [more] CAS2018-17 VLD2018-20 SIP2018-37 MSS2018-17
pp.89-92
CAS, MSS, IPSJ-AL [detail] 2017-11-17
13:00
Tokyo   Generating covering arrays by combining heuristic search and backtracking
Toshiki Sato, Toshihiko Takahashi (Niigata Univ.) CAS2017-54 MSS2017-38
In this report, we propose a combinatorial search scheme by combining heuristic and backtracking. The scheme is validate... [more] CAS2017-54 MSS2017-38
pp.101-103
CAS, CS 2017-02-23
13:05
Shiga   Efficient inspection routes of expressway facilities -- A variation of the vehicle routing problem --
Takumi Otsuka, Toshihiko Takahashi (Niigata Univ.) CAS2016-119 CS2016-80
A lot of equipment (lighting, indicator board, etc.) are installed in each facility (service area, interchange etc.) on ... [more] CAS2016-119 CS2016-80
pp.25-28
CAS, NLP 2016-10-28
09:30
Tokyo   Ranking and Unranking of z Sequences of k-ary Trees Using Colexicographic Order
Takashi Aketagawa, Toshihiko Takahashi (Niigata Univ.) CAS2016-51 NLP2016-77
 [more] CAS2016-51 NLP2016-77
pp.71-74
MSS, CAS, IPSJ-AL [detail] 2015-11-20
16:45
Kagoshima Ibusuki CityHall A Packet Classification Algorithm Based on Trie Considering Matching Orders of Bits
Yuto Kobayashi, Toshihiko Takahashi, Kenji Mikawa (Niigata Univ.), Ken Tanaka (Kanagawa Univ.) CAS2015-53 MSS2015-27
 [more] CAS2015-53 MSS2015-27
pp.65-70
NLP, CAS 2014-10-16
10:15
Ehime Ehime University Enumerating and Indexing of Polyiamonds for p6 Tiling by Using ZDDs
Tomoki Nozawa, Toshihiko Takahashi (Niigata Univ.) CAS2014-54 NLP2014-48
A p6 tiling is a plane tiling by 6-fold rotational copies of a single figure.
A polyiamond or n-iamond is a figure cons... [more]
CAS2014-54 NLP2014-48
pp.17-22
MSS, CAS, IPSJ-AL [detail] 2013-11-07
15:30
Iwate   Construction of a ZDD (Sequence BDD) for Slicing Floorplans
Sousuke Shimizu, Toshihiko Takahashi (Niigata Univ.) CAS2013-71 MSS2013-50
 [more] CAS2013-71 MSS2013-50
pp.151-155
CAS 2013-01-28
09:00
Oita Beppu International Convention Center Enumeration of Baxter Permutations
Sousuke Shimizu, Toshihiko Takahashi (Niigata Univ.) CAS2012-65
 [more] CAS2012-65
pp.1-4
NLP, CAS 2012-09-21
11:45
Kochi Eikokuji Campus, University of Kochi Representation of a Box Partitioned by Rectangles
Toshihiko Takahashi (: Niigata Univ.) CAS2012-43 NLP2012-69
For VLSI layout design, many floorplan representations have been proposed since the mid-1990s. Especially representatio... [more] CAS2012-43 NLP2012-69
pp.71-74
CAS, MSS 2011-11-18
14:45
Yamaguchi Univ. of Yamaguchi A Recurrence for the Number of Baxter Permutations via Rectangular Partition
Toshihiko Takahashi (Niigata Univ.) CAS2011-84 MSS2011-53
A rectangular partition is a subdivision of a rectangle into rectangles by horizontal and vertical line segments.
Enume... [more]
CAS2011-84 MSS2011-53
pp.119-122
CS, SIP, CAS 2011-03-04
09:00
Okinawa Ohhamanobumoto memorial hall (Ishigaki)( On pruning rules in optmal algorithms for the minimum rectilinear Steiner arborescence problem II
Masayuki Nagase, Toshihiko Takahashi (Niigata Univ.) CAS2010-155 SIP2010-171 CS2010-125
 [more] CAS2010-155 SIP2010-171 CS2010-125
pp.311-316
VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM
(Joint) [detail]
2010-12-01
13:35
Fukuoka Kyushu University On pruning rules in exact algorithms for the minimum rectilinear Steiner arborescence problem
Masayuki Nagase, Toshihiko Takahashi (Niigat Univ.) VLD2010-78 DC2010-45
 [more] VLD2010-78 DC2010-45
pp.155-159
MSS, CAS 2010-11-18
13:25
Osaka Kansai Univ. The simplest and smallest network on which the Ford-Fulkerson maximum flow procedure may fail to terminate
Toshihiko Takahashi (Niigata Univ.) CAS2010-69 CST2010-42
 [more] CAS2010-69 CST2010-42
pp.25-30
SIP, CAS, CS 2010-03-02
13:45
Okinawa Hotel Breeze Bay Marina, Miyakojima [Poster Presentation] 2.5-dimensional FT-Squeeze -- Permutation Representation of Stacked Rectangular Drawings --
Toshihiko Takahashi (Niigata Univ.) CAS2009-121 SIP2009-166 CS2009-116
In this report, we introduce a permutation representation of stacked rectangular drawings. This representation does not ... [more] CAS2009-121 SIP2009-166 CS2009-116
pp.239-240
CAS 2010-01-29
09:50
Kyoto Kyoudai-Kaikan Bldg. Effects of Perturbations in Rao's Rectilinear Steiner Arborescence Algorithm
Takuya Yamada, Toshihiko Takahashi (Niigata Univ.), Yoshiaki Abe (Canon Imaging Systems) CAS2009-74
Minimum rectilinear Steiner arborescence problem (MRSA) is to find an rectilinear Steiner arborescence (RSA) rooted at t... [more] CAS2009-74
pp.61-64
CAS, MSS 2008-11-07
13:00
Osaka Osaka University (4n-3)-bit representation of rectangular drawings or floorplans
Toshihiko Takahashi, Ryo Fujimaki (Niigata Univ.), Youhei Inoue (Renesas Technology) CAS2008-57 CST2008-35
 [more] CAS2008-57 CST2008-35
pp.71-76
VLD, CAS, SIP 2008-06-27
11:15
Hokkaido Hokkaido Univ. An asymptotic estimate of the numbers of rectangular drawings or floorplans
Ryo Fujimaki (Niigata Univ.), Youhei Inoue (Renesas Technology), Toshihiko Takahashi (Niigata Univ.) CAS2008-25 VLD2008-38 SIP2008-59
A subdivision of a rectangle into rectangular faces with horizontal and
vertical line segments is called rectangular d... [more]
CAS2008-25 VLD2008-38 SIP2008-59
pp.37-41
MSS, CAS 2007-11-30
15:45
Niigata Niigata University Finding a longest common subsequence of two twistable sequences
Youhei Inoue, Toshihiko Takahashi (Niigata Univ.) CAS2007-83 CST2007-34
Finding a longest common subsequence (LCS) for two given sequences is called the LCS problem, which is classic and solve... [more] CAS2007-83 CST2007-34
pp.55-58
CAS, MSS 2006-11-20
16:25
Nagasaki Nagasaki Univ. Multi-Terminal Net Routing with Wire Length and Congestion Controls
Toshihiko Takahashi, Masahiro Haga (Niigata Univ.)
In the deep submicron technology, many factors in VLSI routing have become critical: the number of layers, wire length, ... [more] CAS2006-53 CST2006-29
pp.67-70
 Results 1 - 20 of 22  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan