Shigeru Masuyama

IEICE Trans. Inf. Syst., August, 2022

Assessing the Impact of an Original Soft Communicative Robot in a Nursing Home in Japan: Will Softness or Conversations Bring more Smiles to Older People?

[BibT_eX]

[DOI]

Kazuko Obayashi

Naonori Kodate

Int. J. Soc. Robotics, 2022

Extraction and classification of risk-related sentences from securities reports.

[BibT_eX]

[DOI]

Int. J. Inf. Manag. Data Insights, 2022

2020

An Algorithm for the Influential Hinge Vertex Problem on Interval Graphs.

[BibT_eX]

[DOI]

Yoko Nakajima

J. Inf. Process., 2020

2019

A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2019

2018

A Linear-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Interval Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2018

Enhancing older people's activity and participation with socially assistive robots: a multicentre quasi-experimental study using the ICF framework.

[BibT_eX]

[DOI]

Kazuko Obayashi

Naonori Kodate

Adv. Robotics, 2018

2017

An Algorithm for Hinge Vertex Problem on Circular Trapezoid Graphs.

[BibT_eX]

[DOI]

Yoko Nakajima

J. Inf. Process., 2017

A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Outerplanar Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2017

2016

A Linear Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Cographs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2016

Creating Japanese Political Corpus from Local Assembly Minutes of 47 prefectures.

[BibT_eX]

[DOI]

Proceedings of the 12th Workshop on Asian Language Resources, 2016

2015

Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Classification of Comments on Nico Nico Douga for Annotation Based on Referred Contents.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Network-Based Information Systems, 2015

2014

Efficient Randomized Byzantine Fault-Tolerant Replication Based on Special Valued Coin Tossing.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2014

A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2014

Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

2013

A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2013

2011

Erratum and addendum to "A linear time algorithm for finding all hinge vertices of a permutation graph" [Information Processing Letters 59 (2) (1996) 103-107].

[BibT_eX]

[DOI]

Kodai Abe

Inf. Process. Lett., 2011

An Algorithm for Minimum Feedback Vertex Set Problem on a Trapezoid Graph.

[BibT_eX]

[DOI]

Yutaro Kitamura

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

2010

A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ... edges.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

NTCIR-8 Patent Mining Task at Toyohashi University of Technology.

[BibT_eX]

[DOI]

Proceedings of the 8th NTCIR Workshop Meeting on Evaluation of Information Access Technologies: Information Retrieval, 2010

2009

Assigning Polarity to Causal Information in Financial Articles on Business Performance of Companies.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs.

[BibT_eX]

[DOI]

Saki Honma

IEICE Trans. Inf. Syst., 2009

Acceleration of Byzantine Fault Tolerance by Parallelizing Consensuses.

[BibT_eX]

[DOI]

Junya Nakamura

Tadashi Araragi

Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

Automatic plagiarism detection among term papers.

[BibT_eX]

[DOI]

Takahisa Ota

Proceedings of the 3rd International Universal Communication Symposium, 2009

2008

An Informative DOM Subtree Identification Method from Web Pages in Unfamiliar Web Sites.

[BibT_eX]

[DOI]

Masanobu Tsuruta

IEICE Trans. Inf. Syst., 2008

Cause Information Extraction from Financial Articles Concerning Business Performance.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2008

An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Formulas for Counting the Numbers of Connected Spanning Subgraphs with at Most n+1 Edges in a Complete Graph Kn.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Inequalities on the Number of Connected Spanning Subgraphs in a Multigraph.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2008

Polarity Assignment to Causal Information Extracted from Financial Articles Concerning Business Performance of Companies.

[BibT_eX]

[DOI]

Proceedings of the Research and Development in Intelligent Systems XXV, 2008

Extracting Causal Knowledge Using Clue Phrases and Syntactic Patterns.

[BibT_eX]

[DOI]

Hiroki Sakaji

Satoshi Sekine

Proceedings of the Practical Aspects of Knowledge Management, 7th International Conference, 2008

Automatic Extraction of Basis Expressions That Indicate Economic Trends.

[BibT_eX]

[DOI]

Hiroki Sakaji

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

2007

A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Extraction of Cause Information from Newspaper Articles Concerning Business Performance.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Innovations 2007: from Theory to Applications, 2007

2006

Knowledge acquisition about the deletion possibility of adnominal verb phrases.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 2006

A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2006

Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Formulation of Mobile Agent Allocation and its Strong NP-Completeness.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2005

2004

A Web Search Result Classification System Based on the Degree of Suitability for Specialists.

[BibT_eX]

[DOI]

Proceedings of the Fourth NTCIR Workshop on Research in Information Access Technologies Information Retrieval, 2004

A Multiple-Document Summarization System Introducing User Interaction for Reflecting User's Summarization Need.

[BibT_eX]

[DOI]

Proceedings of the Fourth NTCIR Workshop on Research in Information Access Technologies Information Retrieval, 2004

Question Answering System QUARK.

[BibT_eX]

[DOI]

Proceedings of the Fourth NTCIR Workshop on Research in Information Access Technologies Information Retrieval, 2004

A Multiple-Document Summarization System with User Interaction.

[BibT_eX]

[DOI]

Proceedings of the COLING 2004, 2004

2003

An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Properties on the Average Number of Spanning Trees in Connected Spanning Subgraphs for an Undirected Graph.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

2002

A Parallel Algorithm for Finding All Hinge Vertices of a Trapezoid Graph.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

Unsupervised Acquisition of Knowledge about the Abbreviation Possibility of some of Multiple Phrases modifying the same Verb/Noun.

[BibT_eX]

[DOI]

Proceedings of the Third NTCIR Workshop on Research in Information Retrieval, 2002

QUARK: A Question and Answering System using Newspaper Corpus as a Knowledge Source.

[BibT_eX]

[DOI]

Keizo Kawata

Proceedings of the Third NTCIR Workshop on Research in Information Retrieval, 2002

2001

On a Retrieval Support System by Suggesting Terms to a User.

[BibT_eX]

[DOI]

Kiyonori Ohtake

Proceedings of the Third Second Workshop Meeting on Evaluation of Chinese & Japanese Text Retrieval and Text Summarization, 2001

Yet Another Summarization System with Two Modules using Empirical Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Third Second Workshop Meeting on Evaluation of Chinese & Japanese Text Retrieval and Text Summarization, 2001

1998

Animation of tree sway.

[BibT_eX]

[DOI]

Chishun Kanayama

Syst. Comput. Jpn., 1998

1997

A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

1995

A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph.

[BibT_eX]

[DOI]

Peng Chen

Inf. Process. Lett., 1994

Edge-disjoint packings of graphs.

[BibT_eX]

[DOI]

Derek G. Corneil

S. Louis Hakimi

Discret. Appl. Math., 1994

1992

Deciding Whether Graph G has Page Number One is in NC.

[BibT_eX]

[DOI]

Shozo Naito

Inf. Process. Lett., 1992

On the tree packing problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1991

Chain Packing in Graphs.

[BibT_eX]

[DOI]

Toshihide Ibaraki

Algorithmica, 1991

1988

Cautious Transaction Schedulers with k Versions.

[BibT_eX]

[DOI]

Makoto Takeda