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 - 20 of 21  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2019-10-25
10:25
Hokkaido Sapporo Campus, Hokkaido University Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number
Kazuhiro Kurita (Hokkaido Univ.), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (Hokkaido Univ.) COMP2019-19
(To be available after the conference date) [more] COMP2019-19
pp.11-18
COMP 2019-10-25
10:50
Hokkaido Sapporo Campus, Hokkaido University Simple Fold and Cut Problem for Line Segments
Guoxin Hu (JAIST), Shin-ichi Nakano (Gunma University), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2019-20
We investigate a natural variant of the fold-and-cut problem. We are given a long paper strip P and n line segments draw... [more] COMP2019-20
pp.19-25
COMP 2019-09-02
10:50
Okayama Tsushima Campus, Okayama University Shortest Universal Sequences of Adjacent Transpositions
Takehiro Ito (Tohoku Univ.), Jun Kawahara, Shin-ichi Minato (Kyoto Univ.), Yota Otachi (Kumamoto Univ.), Toshiki Saitoh (Kyutech), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII), Katsuhisa Yamanaka (Iwate Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-10
Let $S = {s_1,s_2, ... , s_m}$ be a sequence of adjacent transpositions of $[n]={1,2,ldots ,n}$. We denote by $Comp(S) =... [more] COMP2019-10
pp.1-5
COMP 2019-09-02
13:00
Okayama Tsushima Campus, Okayama University [Invited Talk] New Polynomial Delay Bounds for Maximal Subgraph Enumeration by Proximity Search
Alessio Conte, Takeaki Uno (NII) COMP2019-12
 [more] COMP2019-12
p.15
COMP 2018-12-12
10:00
Miyagi Tohoku University Max-Min Dispersion Problems
Takashi Horiyama (Saitama Univ.), Shin-ichi Nakano (Gunma Univ.), Toshiki Saitoh (KIT), Koki Suetsugu (Kyoto Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno, Kunihiro Wasa (NII) COMP2018-31
 [more] COMP2018-31
pp.1-6
ISEC, COMP 2017-12-22
14:40
Kochi Eikokuji Campus, Kochi University of Technology Efficient Enumeration of Dominating Sets in K-Degenerate graphs
Kazuhiro Kurita (HU), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (HU) ISEC2017-89 COMP2017-43
A dominating set is one of the fundamental graph structure, like clique, independent set, s-t path, and cut. It is known... [more] ISEC2017-89 COMP2017-43
pp.111-117
COMP, IPSJ-AL 2016-06-25
15:05
Ishikawa   Computational Complexity of Sequential Token Swapping Problem
Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takashi Horiyama (Saitama Univ.), Akitoshi Kawamura (Univ. of Tokyo), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (UEC), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2016-13
We consider a puzzle consisting of colored tokens on an $n$-vertex graph, where each token has a distinct starting verte... [more] COMP2016-13
pp.115-121
COMP 2014-04-24
10:55
Miyagi Tohoku University Swapping Labeled Tokens on Graphs
Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takehiro Ito (Tohoku Univ.), Jun Kawahara (NAIST), Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Kei Uchizawa (Yamagata Univ.), Takeaki Uno (NII) COMP2014-2
 [more] COMP2014-2
pp.5-12
DE, IPSJ-DBS, IPSJ-IFAT 2013-07-23
16:40
Hokkaido Hokkaido University k-anonymization for large-scale data with less information loss
Keisuke Murakami (Aoyama Gakuin Univ.), Takeaki Uno (NII) DE2013-32
The individual information such as the medical database is useful for data analysis. However, the individual information... [more] DE2013-32
pp.193-198
COMP 2012-06-21
16:45
Hokkaido Hokkaido University Approximation for the Geometric Unique Coverage Problem on Unit Squares
Takehiro Ito (Tohoku Univ.), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Yota Otachi, Ryuhei Uehara (JAIST), Takeaki Uno (NII), Yushi Uno (Osaka Prefecture Univ.) COMP2012-24
 [more] COMP2012-24
pp.95-101
COMP 2012-04-27
14:45
Osaka Osaka Prefecture University On the Base-Line Location Problem for the Maximum Weight Region Decomposable into Base-Monotone Shapes
Takashi Horiyama (Saitama Univ.), Takehiro Ito, Natsuda Kaothanthong (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Yota Otachi (JAIST), Takeshi Tokuyama (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2012-6
 [more] COMP2012-6
pp.37-43
COMP 2012-03-16
16:30
Tokyo Univ. of Tokyo [Invited Talk] My Favorite Garden
Takeaki Uno (NII) COMP2011-55
 [more] COMP2011-55
p.59
IBISML, PRMU, IPSJ-CVIM [detail] 2010-09-05
13:40
Fukuoka Fukuoka Univ. [Special Talk] Pattern Mining meets a New Landing Point -- Pattern mining via clustering --
Takeaki Uno (NII) PRMU2010-66 IBISML2010-38
Pattern mining has a disadvantage that huge amount of similar patterns are detected. There are many researches address t... [more] PRMU2010-66 IBISML2010-38
pp.81-82
COMP 2010-04-22
10:35
Shiga Ritusmeikan University, Biwako-Kusatsu Campus Counting the number of dominating sets in graph classes
Shuji Kijima (Kyushu Univ), Yoshio Okamoto (Tokyo Inst. of Tech.), Takeaki Uno (NII) COMP2010-2
 [more] COMP2010-2
pp.9-15
COMP 2009-06-29
15:25
Hokkaido Hokkaido University Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
Yoshio Okamoto (Tokyo Inst. of Tech.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2009-24
 [more] COMP2009-24
pp.45-52
COMP 2008-10-10
14:30
Miyagi Tohoku Univ. Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
Takehiro Ito (Tohoku Univ.), Takeaki Uno (NII), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) COMP2008-41
Assume that each vertex of a graph $G$ is assigned a nonnegative integer weight and that $l$ and $u$ are integers such t... [more] COMP2008-41
pp.55-61
COMP 2008-04-18
11:10
Osaka Osaka Prefecture University Enumeration of Perfect Sequences of Chordal Graph
Yasuko Matsui (Tokai Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2008-3
A graph is chordal if and only if it has no chordless cycle of length more than three.
The set of maximal cliques in a ... [more]
COMP2008-3
pp.15-22
COMP 2006-03-22
16:00
Tokyo The University of Electro-Communications Canonical Tree Representation of Distance Hereditary Graphs with Applications
Ryuhei Uehara (JAIST), Takeaki Uno (NII)
The class of distance hereditary graphs consists of
the isometric graphs.
That is, for each pair of vertices,
its d... [more]
COMP2005-61
pp.31-36
COMP 2005-09-15
14:35
Osaka Osaka Univ., Toyonaka Campus A Polynomial Space Polynomial Delay Algorithm for Enumerating Maximal Motifs in a Sequence
Hiroki Arimura (Hokkaido Univ.), Takeaki Uno (NII)
In this paper, we consider the problem of finding all maximal motifs in an input string for the class of repeated motifs... [more] COMP2005-32
pp.31-38
COMP 2004-12-10
13:15
Chiba Toho University [Tutorial Lecture]
Takeaki Uno (NII)
A transaction database is a set of transactions where a transaction is a set of items. For a constant theta, frequent it... [more] COMP2004-55
pp.17-19
 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