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 21  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
NLC 2017-09-08
10:00
Tokyo Seikei University An attempt to extract bill lists for collecting bills of local councils
Takuma Tanaka (TUT), Hiroki Sakaji (The Univ of Tokyo), Akio Kobayashi (AIP), Yasutomo Kimura (Otaru Univ of Commerce), Shigeru Masuyama (TUT) NLC2017-23
Abstract In councils of local governments (local council for short), bills are submitted by its head, committees,and mem... [more] NLC2017-23
pp.41-46
NLC, TL 2016-06-04
16:00
Hokkaido Otaru University of Commerce Brand Identity Extraction from Customers' Viewpoint for Agricultural Products.
Akio Kobayashi, Shun Tanaka, Shigeru Masuyama (TUT) TL2016-5 NLC2016-5
(Advance abstract in Japanese is available) [more] TL2016-5 NLC2016-5
pp.19-22
NLC 2015-09-10
14:00
Tokyo Convention Room AP Shibuya-Dogenzaka (Tokyo) An analysis of articles for software licence agreement
Takuji Sakurai, Akio Kobayashi, Shigeru Masuyama (Toyohashi Tech) NLC2015-21
Software licence agreement(SLA) is a contract that permits users to use software.
It describes rights, prohibition, and... [more]
NLC2015-21
pp.25-29
NLC 2014-09-12
10:20
Tokyo Yahoo Japan Inc., 11F Seminar Room Extraction of the useful reviews from Kakaku.com(Price.com)
Yudai Abe, Akio Kobayashi, Shigeru Masuyama (Toyohashi Univ. of Tech.) NLC2014-23
"Kakaku.com" (Price.com) is one of a review site on the Web. Consumers can read a product's review that are written by o... [more] NLC2014-23
pp.27-30
NLC 2014-09-12
13:00
Tokyo Yahoo Japan Inc., 11F Seminar Room Structuring thread contents of Kakaku.com's review bulletin board
Yuta Arai, Akio Kobayashi, Shigeru Masuyama (Toyohashi Univ. of Tech.) NLC2014-25
Nowadays, there are vast information in the Internet. When troubles of consumer electronics happen, customers often find... [more] NLC2014-25
pp.37-40
NLC 2014-09-12
13:50
Tokyo Yahoo Japan Inc., 11F Seminar Room Classification of comments on Nico Nico Douga for annotation based on referred contents
Akihito Ikeda, Akio Kobayashi (Toyohashi Univ. of Tech.), Hiroki Sakaji (Seikei Univ.), Shigeru Masuyama (Toyohashi Univ. of Tech.) NLC2014-27
For Nico Nico Douga, a video sharing website in Japan, one of the largest feature is posted comments. The comments are o... [more] NLC2014-27
pp.47-52
COMP 2014-09-02
10:30
Aichi Toyohashi University of Technology A linear time algorithm for finding a spanning tree with non-terminal set $V_{NT}$ on cographs
Shin-ichi Nakayama (Univ. of Tokushima), Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP2014-16
 [more] COMP2014-16
pp.9-16
COMP 2014-09-02
11:00
Aichi Toyohashi University of Technology An Algorithm for Feedback Vertex Set Problem on a Non-degenerate Circular-arc Graph
Hirotoshi Honma, Yoko Nakajima (Kushiro NCT), Shigeru Masuyama (Toyohashi Univ. Tech.) COMP2014-17
 [more] COMP2014-17
pp.17-22
COMP 2014-09-02
13:30
Aichi Toyohashi University of Technology [Invited Talk] Modeling and Algorithm/Complexity Theory -- Scheduling in Railroad, AGV(Automated Guided Vehicle) NPB League as Examples --
Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP2014-19
This paper discuss and suggest how knowledge on algorithm design theory and computational complexity theory help to mo... [more] COMP2014-19
pp.29-34
NLC 2011-07-07
13:35
Tokyo IBM Japan, Ltd. An Extraction Method of Causal Knowledge from Newspaper Corpus
Hiroki Sakaji, Shigeru Masuyama (TUT) NLC2011-2
This paper proposes a method that extracts causal knowledge from news paper articles via clue expressions.
Our method d... [more]
NLC2011-2
pp.7-10
NLC, IPSJ-NL 2010-07-23
11:30
Miyagi Tohoku Univeristy Determining Causal Relation at Sentences in Newspaper Articles
Hiroki Sakaji, Shigeru Masuyama, Hiroyuki Sakai (Toyohashi Univ. of Tech.) NLC2010-4
We propose a method for determining causal relation in newspaper sentences with clue expressions.

Clue expressions in... [more]
NLC2010-4
pp.47-50
SS 2009-03-02
15:15
Saga Saga University An Application development using the object oriented language based on an improvement taint model
Kiyotaka Atsumi (Suzuka National Coll. of Tech.), Shigeru Masuyama (Toyohashi Univ. of Tech.) SS2008-50
Although the taint model and sandbox model are proposed as a security
model of a programming language, we have proposed... [more]
SS2008-50
pp.13-16
COMP 2008-09-11
09:30
Aichi Nagoya Inst. of Tech. Counting Connected Spanning Subgraphs with at Most p+q+1 Edges in a Complete Bipartite Graph Kp,q
Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Technology) COMP2008-24
Let $N_{i}(G)$ denote the number of connected spanning $i$-edge subgraphs
in an $n$-vertex $m$-edge undirected graph $... [more]
COMP2008-24
pp.9-16
COMP 2008-06-16
15:35
Ishikawa JAIST Formulas for Counting Connected Spanning Subgraphs with at Most $n+1$ Edges in Graphs $K_{n}-e$, $K_{n}\cdot e$
Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Tech) COMP2008-21
Let $N_{i}(G)$ denote the number of connected spanning $i$-edge subgraphs
in an $n$-vertex $m$-edge undirected graph $... [more]
COMP2008-21
pp.43-48
COMP 2007-12-14
16:15
Hiroshima Hiroshima University Formulas on the Numbers of Connected Spanning Subgraphs with at Most n+1 Edges in a Complete Graph Kn
Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyahashi Univ. of Tech.) COMP2007-53
Let $N_{i}$ be the number of all connected spanning subgraphs
with $i(n-1\leq i\leq m)$ edges in an $n$-vertex $m$-edg... [more]
COMP2007-53
pp.35-42
COMP 2007-09-20
11:10
Aichi   Techniques to Accelerate Request Processing for Byzantine Fault Tolerance
Junya Nakamura (Toyohashi Univ. of Tech.), Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP2007-34
 [more] COMP2007-34
pp.13-20
COMP 2007-09-20
16:25
Aichi   A Proof of Unimodality on the Numbers of Connected Spanning Subgraphs in an $n$-Vertex Graph with at Least $\bigl\lceil(3-2\sqrt{2})n^2+n-\frac{7-2\sqrt{2}}{2\sqrt{2}}\bigr\rceil$ Edges
Peng Cheng (Nagoya Gakuin Univ), Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP2007-40
Consider an undirected simple graph $G=(V,E)$ with $n$ vertices and $m$ edges, and let $N_{i}$ be the number of connecte... [more] COMP2007-40
pp.59-66
COMP 2006-10-17
11:35
Miyagi Tohoku University Byzantine Agreement on the Order of Processing Received Requests is Solvable Deterministically in Asynchronous Systems
Junya Nakamura (Toyohashi Univ. of Tech.), Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.)
In an asynchronous distributed system, a fault-tolerant method based on system replication has been introduced.
Replica... [more]
COMP2006-35
pp.33-40
NLC 2006-02-02
16:15
Shiga Laforet Biwako Similar Part Detection for Term Papers
Takahisa Ota, Shigeru Masuyama (TUT)
 [more] NLC2005-112
pp.37-42
NLC 2006-02-03
10:30
Shiga Laforet Biwako Estimating Sentiment Score of Links in Weblog -- For Improvement of Finding Web Communities --
Koji Matsuda, Yuji Yamamoto, Hiroyuki Sakai, Shigeru Masuyama (TUT)
 [more] NLC2005-116
pp.13-18
 Results 1 - 20 of 21  /  [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