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

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 70  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
IN, CCS
(Joint)
2022-08-05
09:00
Hokkaido Hokkaido University(Centennial Hall)
(Primary: On-site, Secondary: Online)
Autonomous Congestion Control Mechanism Using Random Early Detection in Asynchronous Random Walker Processing
Shun Takizawa, Kunitake Kaneko (Keio Univ.) IN2022-18
In large-scale graph analysis, Random Walk (RW) is useful and has been implemented in both synchronous and asynchronous ... [more] IN2022-18
pp.15-20
IN, RCS, NV
(Joint)
2022-05-27
16:00
Kanagawa Keio University (Hiyoshi Campus)
(Primary: On-site, Secondary: Online)
Apporoximation Betweenness Centrality focusing on paths affected by the connection of two graph
Kaito Miyakoshi, Kunitake Kaneko (Keio Univ.) IN2022-11
Betweenness Centrality(BC) is an importance measure that expresses the number of times a target vertex is included in th... [more] IN2022-11
pp.50-55
NS, IN
(Joint)
2022-03-11
14:20
Online Online A Method for Generating Random Walk Paths Focusing Only on Updates Near A Source Node in Dynamic Distributed Graphs
Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2021-48
In graph calculations with a lot of random walks (RWs), some long RWs become bottlenecks, and thus pre-execution of RWs ... [more] IN2021-48
pp.103-108
IN, NS, CS, NV
(Joint)
2021-09-09
13:05
Online Online Quantitative Evaluation of the Number of Servers Required to Obtain the Coverage of Community Formation Vertices in Autonomous Decentralized Management Graphs
Satoshi Tanaka, Kunitake Kaneko (Keio Univ.) IN2021-13
An autonomous decentralized management graph is a graph in which each of the multiple managers autonomously decides whic... [more] IN2021-13
pp.7-12
RCS, IN, NV
(Joint)
2021-05-28
11:20
Online Online Orientation Estimation of Interests using Approximate Minimum Steiner Tree
Urara Kobayashi, Naoki Matsumoto, Kunitake Kaneko (Keio Univ.) IN2021-4
In recent years, there has been a tendency to represent information by graph according to services, and it attracts atte... [more] IN2021-4
pp.19-24
RCS, IN, NV
(Joint)
2021-05-28
11:45
Online Online An Evaluation of Tracking Performance of Personalized PageRank Using Random Walk in Dynamic Graphs
Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2021-5
By combining graphs managed by multiple services, we can create an autonomous distributed graph that enables multiple se... [more] IN2021-5
pp.25-30
NS 2021-05-13
14:50
Online Online Evaluation of the effect of vertex replication for random walk in autonomous distributed graphs
Yoichi Ozaki, Kunitake Kaneko (Keio Univ.) NS2021-19
It is important to obtain a subgraph from a distributed graph by Random Walk while maintaining the rough structure of th... [more] NS2021-19
pp.26-31
NS 2021-05-13
15:15
Online Online Graph Reordering while Acquiring Graph Data Managed Distributedly by Random Walk
Kohei Tsuchida, Kunitake Kaneko (Keio Univ.) NS2021-20
It is known that cache misses occur so many times, which leads to slow down the calculation speed while graph processing... [more] NS2021-20
pp.32-37
IN 2021-01-18
10:30
Online Online Local community and weak ties detection using random walk on hypergraph.
Ryo Oka (Keio Univ.), Yuuki Takai (RIKEN), Naoki Matsumoto (Keio Univ.), Masahiro Ikeda (RIKEN), Kunitake Kaneko (Keio Univ.) IN2020-41
There are many services that use a graph with a content as a vertex and their relationship as a edge. Community detectio... [more] IN2020-41
pp.1-6
IN, CCS
(Joint)
2020-08-04
14:55
Online Online Landmark Decision Method Combining Random Walk and Betweenness Centrality
Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2020-19
Abstract Highly reproducible presentations of important nodes near the node of interest are useful in determin- ing land... [more] IN2020-19
pp.59-64
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
IN, CCS
(Joint)
2020-08-04
15:45
Online Online Content Identifier Avoiding Price Comparison and Duplicate Purchase
Satoshi Tanaka, Kunitake Kaneko (Keio Univ.) IN2020-21
 [more] IN2020-21
pp.71-76
IN 2020-01-23
15:15
Aichi WINC AICHI Design and implementation of a graphAPI server that enables the use of existing databsaes and flexible graph operations
Ryo Yoshitani, Kunitake Kaneko (Keio Univ.) IN2019-68
We are researching an autonomous decentralized graph platform where multiple organizations can connect their own data to... [more] IN2019-68
pp.19-24
IN 2020-01-23
15:40
Aichi WINC AICHI Fire spread model for content recommendation in non-property graphs
Yasutaka Shigano, Kunitake Kaneko (Keio Univ.) IN2019-69
 [more] IN2019-69
pp.25-30
IN, NS
(Joint)
2019-03-05
11:10
Okinawa Okinawa Convention Center Virtual File: Wide Area Data Exchange Format Apart from Access Control and File Retrieval
Ryo Ogitani, Kunitake Kaneko (Keio Univ.) IN2018-127
The data exchange is important to promote the utilization of digital data. “Data exchange” means the state that users ca... [more] IN2018-127
pp.259-264
IN, RCS, NV
(Joint)
2018-05-10
14:05
Kanagawa Keio University [Invited Talk] Networking of Digital Information for Multi-purpose and Long-term Utilization
Kunitake Kaneko (Keio Univ.) IN2018-1 RCS2018-26
Lots of digital files are created everyday over the world and most of the files cannot be popular and are stored without... [more] IN2018-1 RCS2018-26
pp.1-6(IN), pp.25-30(RCS)
IA, SITE, IPSJ-IOT [detail] 2018-03-06
14:20
Tochigi Kinugawa Onsen Hotel Accuracy of Clock Synchronization in IEEE1588 where Boundary Clock and Synchronous Ethernet are Combined
Koki Horita (Keio Univ.), Shota Shiobara, Takao Okamawari, Yoichi Goto (Softbank), Fumio Teraoka, Kunitake Kaneko (Keio Univ.) SITE2017-78 IA2017-89
 [more] SITE2017-78 IA2017-89
pp.233-238
IN 2018-01-22
13:25
Aichi WINC AICHI Media Content Management System using Blockchain Technology
Yuya Sato, Kunitake Kaneko (Keio Univ.) IN2017-75
Recently, in order to distribute media contents on the Internet, blockchain technology is expected as a media content ma... [more] IN2017-75
pp.31-36
IN 2018-01-22
13:50
Aichi WINC AICHI Autonomous Distributed Calculation and Storage of Tie Strengths between Contents in Graph System
Daichi Kitamura, Kunitake Kaneko (Keio University) IN2017-76
Graphs as relation between contents is used to calculate the tie strength between them and it is of- ten used for recomm... [more] IN2017-76
pp.37-42
IA, IN
(Joint)
2017-12-14
10:50
Hiroshima Hiroshima City Univ. Design and implementation of Balloon System for introducing distributed applications into SFC
Sunao Otake, Kunitake Kaneko (Keio Univ.) IN2017-47
Service function chaining (SFC) enables the creation of composite services that consist of an ordered set of SFs which m... [more] IN2017-47
pp.7-12
 Results 1 - 20 of 70  /  [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