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  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 9 of 9  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2022-10-26
11:15
Fukuoka Kyusyu Univ. Nishijin Plaza A Moderately Exponential Time Satisfiability Algorithm for Linear-Sized Deterministic Width-2 Branching Programs
Tomu Makita (Seikei Univ.), Atsuki Nagao (Ochanomizu Univ.), Tatsuki Okada (Seikei Univ.), Kazuhisa Seto (Hokkaido Univ.), Junichi Teruyama (Univ. of Hyogo) COMP2022-14
 [more] COMP2022-14
pp.2-6
COMP 2022-10-26
11:45
Fukuoka Kyusyu Univ. Nishijin Plaza Evacuation problems on grid networks with uniform transit time and uniform capacity
Yuki Tokuni, Naoki Katoh, Junichi Teruyama, Yuya Higashikawa (Uoh) COMP2022-15
We consider the problem of finding the minimum time at which all supplies on a dynamic flow network can reach the demand... [more] COMP2022-15
pp.7-13
COMP 2020-03-01
14:50
Tokyo The University of Electro-Communications
(Cancelled but technical report was issued)
Minmax regret 1-sink problem with parametric weights
Yuki Tokuni (Kwansei Gakuin Univ.), Noaki Katoh, Junichi Teruyama, Yuya Higashikawa, Tetsuya Fujie (Univ. of Hyogo) COMP2019-51
This paper addresses the minmax regret 1-sink problem in dynamic path networks with parametric weights. A dynamic path n... [more] COMP2019-51
pp.35-41
COMP 2018-09-18
13:25
Fukuoka Kyusyu Institute of Technology Minimax regret 1-center problems with parametric weights
Shohei Ookatsu, Naoki Katoh (Kwansei Gakuin Univ.), Junichi Teruyama, Yuya Higashikawa (Univ. of Hyogo), Hiroyoshi Miwa (Kwansei Gakuin Univ.) COMP2018-13
In this paper, based on the minimax regret model which is an approach for the robust optimization, we consider 1-center ... [more] COMP2018-13
pp.29-33
COMP 2018-09-18
16:00
Fukuoka Kyusyu Institute of Technology NP-hardness of k-modularity maximization on sparse graphs
Shunsuke Hirata, Francois Le Gall, Suguru Tamaki (Kyoto Univ.), Junichi Teruyama (Univ. of Hyogo) COMP2018-18
 [more] COMP2018-18
pp.63-68
COMP 2016-10-21
14:00
Miyagi Tohoku University An Exact Algorithm for the Satisfiability of Depth-2 SYM-AND Circuits.
Kazuhisa Seto (Seikei Univ.), Suguru Tamaki (Kyoto Univ.), Junichi Teruyama (NII) COMP2016-27
A Boolean function $f: bits{n} to bit$ is {em weighted symmetric}
if there exist a function $g: mathbb{Z} to bit$ and i... [more]
COMP2016-27
pp.29-34
COMP 2013-12-21
11:25
Okinawa Okinawa Industry Support Center Efficient Algorithms for Sorting $k$-Sets in Bins
Kazuhisa Seto (Seikei Univ.), Junichi Teruyama (NII), Atsuki Nagao (Kyoto Univ.) COMP2013-52
We give efficient algorithms for Sorting $k$-Sets in Bins.
The Sorting $k$-Sets in Bins problem can be described as f... [more]
COMP2013-52
pp.81-85
COMP 2012-04-27
10:35
Osaka Osaka Prefecture University Reconstructing Strings from Substrings with Quantum Queries
Richard Cleve (Univ. of Waterloo), Kazuo Iwama (Kyoto Univ.), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT), Junichi Teruyama (Kyoto Univ.), Shigeru Yamashita (Ritsumeikan Univ.) COMP2012-2
This paper investigates the number of quantum queries made
to solve the problem of reconstructing an unknown string fro... [more]
COMP2012-2
pp.7-14
COMP 2010-01-25
15:00
Fukuoka Nishijin Plaza, Kyushu University An Almost Optimal Algorithm for Winkler's Sorting Pairs in Bins
Hiro Ito, Junichi Teruyama, Yuichi Yoshida (Kyoto Univ.) COMP2009-45
We investigate the following sorting puzzle:
We are given $n$ bins with two balls in each bin.
Balls in the $i$th bin ... [more]
COMP2009-45
pp.45-49
 Results 1 - 9 of 9  /   
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