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 - 16 of 16  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
NS, NWS
(Joint)
2022-01-28
10:50
Online Online [Encouragement Talk] Degree Based Vertex Replication Method for Random Walk in Autonomous Distributed Graphs
Ozaki Yoichi, Kaneko Kunitake (Keio Univ.) NS2021-116
In autonomously distributed graphs, the vertex set placed on a server does not always follow the community structure of ... [more] NS2021-116
pp.36-41
IN, CCS
(Joint)
2020-08-04
15:20
Online Online Continuous Extension of Distributed Graph Management and General Replication Factor
Yoichi Ozaki, Kunitake Kaneko (Keio Univ.) IN2020-20
Replication Factor (RF) and Edge Cut (EC) are known as values that characterize the graph partitioning policy in central... [more] IN2020-20
pp.65-70
SP, EA, SIP 2020-03-03
09:00
Okinawa Okinawa Industry Support Center
(Cancelled but technical report was issued)
[Poster Presentation] Multi-scale graph construction method for graph signal coding with SPIHT algorithm
Kosuke Abe, Yuichi Tanaka (TUAT) EA2019-151 SIP2019-153 SP2019-100
Set Partitioning In Hierarchical Trees (SPIHT) is an efficient wavelet-based image coding method. It is designed for pro... [more] EA2019-151 SIP2019-153 SP2019-100
pp.289-294
MSS, CAS, IPSJ-AL [detail] 2018-11-12
15:50
Shizuoka   Stability Subnet Detection of Petri Net by Circuit Flow-Matrix Transformation
Yojiro Harie, Katsumi Wasaki (Shinshu Univ.) CAS2018-64 MSS2018-40
Petri net is a graphical and mathematical modeling tool describes distributed systems.
For dynamic analysis of Petri ne... [more]
CAS2018-64 MSS2018-40
pp.37-42
COMP 2018-10-26
15:55
Kyoto Kyoto University [Invited Lecture] Report of Presentation in SEA2018 and Recent Study
Yu Nakahata, Jun Kawahara (NAIST) COMP2018-29
Partitioning a graph into balanced components is important for several applications. For multi-objective problems, it is... [more] COMP2018-29
p.57
IA, IN
(Joint)
2017-12-14
16:45
Hiroshima Hiroshima City Univ. Dynamic Partition by Local Calculation in Large Scale Distributed Graph Environment
Yuta Yasumura, Kunitake Kaneko (Keio Univ.) IN2017-55
In the processing framework in the large scale distributed graph environment, the entire shape of the input graph is fir... [more] IN2017-55
pp.55-60
CNR, IN, MoNA
(Joint) [detail]
2017-11-16
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.) IN2017-40 CNR2017-17
Catalogue System stores and shares information on the relationships between digital contents as graphs by an autonomousl... [more] IN2017-40 CNR2017-17
pp.9-16
RCS, IT, SIP 2016-01-18
11:25
Osaka Kwansei Gakuin Univ. Osaka Umeda Campus Cutsize Distributions for Partitions of Random Hypergraphs
Takayuki Nozaki (Yamaguchi Univ.) IT2015-51 SIP2015-65 RCS2015-283
A parallel encoding algorithm for low-density parity-check (LDPC) codes is realized by partitioning a hypergraph represe... [more] IT2015-51 SIP2015-65 RCS2015-283
pp.19-24
AI 2013-11-29
13:30
Fukuoka   Multi-Robot Area Partitioning based on differences in patrolling algorithms
Chihiro Kato, Toshiharu Sugawara (Waseda Univ.) AI2013-31
We propose a method for decentralized task/area partitioning for coordination in cleaning domains. We focused on a clean... [more] AI2013-31
pp.71-76
SS, IPSJ-SE 2013-10-24
14:50
Ishikawa   partitioning commits using data dependency among variables in source code
Hiroyuki Kirinuki, Keisuke Hotta, Yoshiki Higo, Shinji Kusumoto (Osaka Univ.) SS2013-43
Although developers should do one commit for every task, they often commit multiple tasks at the same time. It has been ... [more] SS2013-43
pp.67-72
COMP, IPSJ-AL 2013-05-18
11:25
Hokkaido Otaru University of Commerce Testing Subdivision-Freeness -- Property Testing Meets Structural Graph Theory --
Ken-ichi Kawarabayashi (NII), Yuichi Yoshida (NII/PFI) COMP2013-15
Testing a property P of graphs in the bounded-degree model deals with the following problem: given a graph G of bounded ... [more] COMP2013-15
pp.117-121
IE, ITS, ITE-HI, ITE-ME, ITE-AIT 2009-02-05
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 Electro-Commnications.) ITS2008-68 IE2008-238
We propose a method for detecting and tracking vehicles in multilane traffic flow by using a camera installed on an over... [more] ITS2008-68 IE2008-238
pp.195-200
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
PRMU, DE 2007-06-29
13:30
Hokkaido Hokkaido Univ. Graph Clustering with a Nonparametric Bayes Model
Shuhei Kuwata, Naonori Ueda, Takeshi Yamada (NTT) DE2007-15 PRMU2007-41
We propose a new graph clustering method based on a nonparametric Bayesian model. Recently, Newman et al. proposed an ef... [more] DE2007-15 PRMU2007-41
pp.81-86
COMP 2006-10-17
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] COMP2006-33
pp.17-23
COMP 2005-01-28
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] COMP2004-66
pp.47-56
 Results 1 - 16 of 16  /   
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