Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
NS, NWS (Joint) 
20220128 10:50 
Online 
Online 
[Encouragement Talk]
Degree Based Vertex Replication Method for Random Walk in Autonomous Distributed Graphs Ozaki Yoichi, Kaneko Kunitake (Keio Univ.) NS2021116 
In autonomously distributed graphs, the vertex set placed on a server does not always follow the community structure of ... [more] 
NS2021116 pp.3641 
IN, CCS (Joint) 
20200804 15:20 
Online 
Online 
Continuous Extension of Distributed Graph Management and General Replication Factor Yoichi Ozaki, Kunitake Kaneko (Keio Univ.) IN202020 
Replication Factor (RF) and Edge Cut (EC) are known as values that characterize the graph partitioning policy in central... [more] 
IN202020 pp.6570 
SP, EA, SIP 
20200303 09:00 
Okinawa 
Okinawa Industry Support Center (Cancelled but technical report was issued) 
[Poster Presentation]
Multiscale graph construction method for graph signal coding with SPIHT algorithm Kosuke Abe, Yuichi Tanaka (TUAT) EA2019151 SIP2019153 SP2019100 
Set Partitioning In Hierarchical Trees (SPIHT) is an efficient waveletbased image coding method. It is designed for pro... [more] 
EA2019151 SIP2019153 SP2019100 pp.289294 
MSS, CAS, IPSJAL [detail] 
20181112 15:50 
Shizuoka 

Stability Subnet Detection of Petri Net by Circuit FlowMatrix Transformation Yojiro Harie, Katsumi Wasaki (Shinshu Univ.) CAS201864 MSS201840 
Petri net is a graphical and mathematical modeling tool describes distributed systems.
For dynamic analysis of Petri ne... [more] 
CAS201864 MSS201840 pp.3742 
COMP 
20181026 15:55 
Kyoto 
Kyoto University 
[Invited Lecture]
Report of Presentation in SEA2018 and Recent Study Yu Nakahata, Jun Kawahara (NAIST) COMP201829 
Partitioning a graph into balanced components is important for several applications. For multiobjective problems, it is... [more] 
COMP201829 p.57 
IA, IN (Joint) 
20171214 16:45 
Hiroshima 
Hiroshima City Univ. 
Dynamic Partition by Local Calculation in Large Scale Distributed Graph Environment Yuta Yasumura, Kunitake Kaneko (Keio Univ.) IN201755 
In the processing framework in the large scale distributed graph environment, the entire shape of the input graph is fir... [more] 
IN201755 pp.5560 
CNR, IN, MoNA (Joint) [detail] 
20171116 13:25 
Fukuoka 

Graph replication for wide range graph acquisition in wide area autonomous distributed graph system Soichiro Iwai, Fumio Teraoka, Kunitake Kaneko (Keio Univ.) IN201740 CNR201717 
Catalogue System stores and shares information on the relationships between digital contents as graphs by an autonomousl... [more] 
IN201740 CNR201717 pp.916 
RCS, IT, SIP 
20160118 11:25 
Osaka 
Kwansei Gakuin Univ. Osaka Umeda Campus 
Cutsize Distributions for Partitions of Random Hypergraphs Takayuki Nozaki (Yamaguchi Univ.) IT201551 SIP201565 RCS2015283 
A parallel encoding algorithm for lowdensity paritycheck (LDPC) codes is realized by partitioning a hypergraph represe... [more] 
IT201551 SIP201565 RCS2015283 pp.1924 
AI 
20131129 13:30 
Fukuoka 

MultiRobot Area Partitioning based on differences in patrolling algorithms Chihiro Kato, Toshiharu Sugawara (Waseda Univ.) AI201331 
We propose a method for decentralized task/area partitioning for coordination in cleaning domains. We focused on a clean... [more] 
AI201331 pp.7176 
SS, IPSJSE 
20131024 14:50 
Ishikawa 

partitioning commits using data dependency among variables in source code Hiroyuki Kirinuki, Keisuke Hotta, Yoshiki Higo, Shinji Kusumoto (Osaka Univ.) SS201343 
Although developers should do one commit for every task, they often commit multiple tasks at the same time. It has been ... [more] 
SS201343 pp.6772 
COMP, IPSJAL 
20130518 11:25 
Hokkaido 
Otaru University of Commerce 
Testing SubdivisionFreeness
 Property Testing Meets Structural Graph Theory  Kenichi Kawarabayashi (NII), Yuichi Yoshida (NII/PFI) COMP201315 
Testing a property P of graphs in the boundeddegree model deals with the following problem: given a graph G of bounded ... [more] 
COMP201315 pp.117121 
IE, ITS, ITEHI, ITEME, ITEAIT 
20090205 14:20 
Hokkaido 
Graduate School of Information Science and Technology Hokkaido Univ 
Robust Vehicle Tracking to Various Brightness Conditions and an Application to the Measurement of Traffic Parameters Tomoaki Hirooka, Wataru Mitsuhashi (The Univ of ElectroCommnications.) ITS200868 IE2008238 
We propose a method for detecting and tracking vehicles in multilane traffic flow by using a camera installed on an over... [more] 
ITS200868 IE2008238 pp.195200 
COMP 
20081010 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.) COMP200841 
Assume that each vertex of a graph $G$ is assigned a nonnegative integer weight and that $l$ and $u$ are integers such t... [more] 
COMP200841 pp.5561 
PRMU, DE 
20070629 13:30 
Hokkaido 
Hokkaido Univ. 
Graph Clustering with a Nonparametric Bayes Model Shuhei Kuwata, Naonori Ueda, Takeshi Yamada (NTT) DE200715 PRMU200741 
We propose a new graph clustering method based on a nonparametric Bayesian model. Recently, Newman et al. proposed an ef... [more] 
DE200715 PRMU200741 pp.8186 
COMP 
20061017 10:25 
Miyagi 
Tohoku University 
Approximability of Partitioning Graphs with Supply and Demand Takehiro Ito (Tohoku Univ.), Erik D.Demaine (MIT), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) 
Suppose that each vertex of a graph $G$ is either a supply vertex or a demand vertex and is assigned a positive real num... [more] 
COMP200633 pp.1723 
COMP 
20050128 13:30 
Aichi 
Nagoya University 
Partitioning Graphs of Supply and Demand Takehiro Ito, Xiao Zhou, Takao Nishizeki (Tohoku Univ.) 
Assume that each vertex of a graph $G$ is either a supply vertex or a demand vertex and is assigned a positive integer, ... [more] 
COMP200466 pp.4756 