| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| NS, IN (Joint) |
2024-03-01 10:10 |
Okinawa | Okinawa Convention Center | A Performance Evaluation of Graph Cutting Methods that Maintain the Shortest Paths in Internet Topology Masatoshi Enomoto (YCC), Ken-ichi Chinen (TMCIT)  IN2023-90 |
The Internet is operated in units of autonomous systems (AS). By interconnecting multiple ASes, the ASes maintain commu... [more] |
IN2023-90 pp.148-153 |
| 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 |
| 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 |
| COMP, IPSJ-AL | 2018-05-25 16:20 |
Aichi | Nagoya Institute of Technology | Optimal partition of a tree with social distance Masahiro Okubo (Nagoya Univ.), Tesshu Hanaka (Chuo Univ.), Hirotaka Ono (Nagoya Univ.) COMP2018-3 |
Given a graph $G=(V,E)$, a partition ${C_1,C_2, ldots, C_k}$ of $V$ is called a graph partition. We consider a social we... [more] | COMP2018-3 pp.37-44 |
| 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 |
|
| 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 | 2008-06-19 09:30 |
Hokkaido | Otaru-Shimin-Kaikan | Shape Segmentation Based on Learning of Deformation Models Ruiqi Guo, Shinichiro Omachi, Hirotomo Aso (Tohoku Univ.) DE2008-1 PRMU2008-19 |
In this paper, we propose a novel framework of shape segmentation based on the learning of deformation models of multipl... [more] | DE2008-1 PRMU2008-19 pp.1-6 |
[Return to Top Page]