Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2021-03-08 15:45 |
Online |
Online |
A further improved MCT algorithm for finding a maximum clique Jiro Yanagisawa, Etsuji Tomita (UEC), Kengo Katayama, Kanahara Kazuho (OUS), Takahisa Toda, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2020-35 |
We improve further the MCT algorithm for finding a maximum clique (FAW 2016, LNCS 9711, pp.215-226, 2016). First, we em... [more] |
COMP2020-35 pp.38-45 |
QIT (2nd) |
2020-12-10 13:00 |
Online |
Online |
[Poster Presentation]
On run-time errors in quantum annealers Hiroto Yamakawa (UEC), Seiya Okubo (US), Tetsuro Nishino (UEC) |
Quantum annealing is a heuristic solution searching method to search for the optimal solution of an objective function u... [more] |
|
COMP |
2018-10-26 11:15 |
Kyoto |
Kyoto University |
Atsuki Nagao (Ochanomizu Univ.), Sora Matsuzaki, Etsuji Tomita, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2018-23 |
We enhance MCT (an algorithm for the maximum clique problem; presented by authors in FAW 2016, LNCS 9711, pp.215-226, 20... [more] |
COMP2018-23 pp.17-24 |
KBSE |
2015-03-05 10:05 |
Tokyo |
The University of Electro-Communications |
Practice and Evaluation of EPISODE on developing ICT based course material for children with a developmental disability Takahiro Kaneyama, Takaaki Goto, Tetsuro Nishino (UEC) KBSE2014-52 |
In the education of children with developmental disabilities, attempts have been made to include ICT (Information and Co... [more] |
KBSE2014-52 pp.1-6 |
COMP, IPSJ-AL |
2014-06-14 10:55 |
Ehime |
Matsuyama, Ehime |
A Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi (Waseda Univ.), Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2014-13 |
This paper presents a further improved extended result for polynomial-time solvability of the maximum clique problem, th... [more] |
COMP2014-13 pp.85-92 |
KBSE |
2014-05-30 14:45 |
Kanagawa |
Keio Univ.(Raiou-sha, Hiyoshi Campus) |
A Methodology for Developing Open-source Software by Small Groups Takaaki Goto, Tetsuro Nishino (UEC), Kensei Tsuchida (Toyo Univ.) KBSE2014-10 |
In software development, a waterfall model is used, especially for large-scale software systems. For
smaller software d... [more] |
KBSE2014-10 pp.53-58 |
KBSE |
2014-03-07 14:20 |
Okinawa |
Okinawaken-Seinenkaikan |
Software-Aided Feature Selection for Open Source Software by Applying Brainstorming Methodology Based on Existing Open Source Software Md. Mahfuzus Salam Khan, Takaaki Goto, Tetsuro Nishino (Univ. of Electro-Comm.) KBSE2013-96 |
Teams with small size lacks of expert knowledge while starting a new open source software (OSS) project where there exis... [more] |
KBSE2013-96 pp.103-108 |
KBSE |
2013-11-02 09:30 |
Ehime |
Ehime University |
Ontology Design Based on Community Knowledge to Enhance Open Source Activity Md. Mahfuzus Salam Khan, Takaaki Goto, Tetsuro Nishino (Univ. of Electro-Comm.) KBSE2013-59 |
In the field of open source software development, open source initiators are strongly aware of the project vision and th... [more] |
KBSE2013-59 pp.31-35 |
KBSE |
2013-09-12 10:05 |
Tokyo |
The University of Electro-Communications |
A New Technique to Improve Code Readability by Omitting Similar Source Code Patterns Hiroshi Kikuchi, Tetsuro Nishino, Takaaki Goto, Mitsuo Wakatsuki (UEC) KBSE2013-36 |
To understand existing software, we need to read the source code of the software. However, source code reading is time c... [more] |
KBSE2013-36 pp.1-6 |
COMP |
2012-09-03 10:50 |
Tokyo |
Hosei University |
An Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2012-28 |
This paper presents an improved extended result for polynomial-time solvability of the maximum clique problem, that is:
... [more] |
COMP2012-28 pp.17-24 |
COMP |
2011-10-21 11:10 |
Miyagi |
Tohoku Univ. |
An Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-30 |
This report presents a result for polynomial-time solvability of the maximum clique problem, that is:for any pair of ver... [more] |
COMP2011-30 pp.15-22 |
COMP |
2011-04-22 13:55 |
Kyoto |
Kyoto University |
A further improved result on polynomial-time solvability of the maximum clique problem Hiroaki Nakanishi (UEC), Etsuji Tomita (UEC/Chuo Univ.), Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-6 |
This report presents a further improved result for polynomial-time solvability of the maximum clique problem, that is: f... [more] |
COMP2011-6 pp.41-48 |
SITE, IPSJ-EIP |
2010-05-28 13:25 |
Tokyo |
|
UEC Software Repository and Practical Software Development Education Takaaki Goto, Tetsuro Nishino (Univ. of Electro-Comm.) SITE2010-4 |
Most of softwares developed in universities are mainly used by developers themselves. In addition, these softwares have ... [more] |
SITE2010-4 pp.25-30 |
NC |
2010-01-18 14:15 |
Hokkaido |
Hyakunen-Kinen in Hokkaido University |
A study of the timing mechanism in a cerebellar network model implemented on FPGA Kanako Matsuno (UEC), Takeru Honda (UEC/RIKEN), Hideaki Manabe (UEC), Shigeru Tanaka (UEC/RIKEN), Tetsuro Nishino (UEC) NC2009-72 |
A cerebellar network model has been proposed previously,
in which the passage of time can be represented based on the ... [more] |
NC2009-72 pp.7-12 |
NC |
2008-01-15 16:30 |
Hokkaido |
Centennial Hall, Hokkaido Univ. |
A study of timing mechanism and state transition in a spiking network model of the cerebellar granule cell layer Takeru Honda (UEC), Tadashi Yamazaki, Shigeru Tanaka (RIKEN BSI), Tetsuro Nishino (UEC) NC2007-95 |
In this study, we built a spiking network model of the cerebellar granular layer, and analyzed its dynamics.When input s... [more] |
NC2007-95 pp.49-54 |
SCE |
2006-01-27 14:55 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
[Invited Talk]
Current Trends in Quantum Complexity Theory Tetsuro Nishino (UEC) |
[more] |
SCE2005-27 pp.25-29 |