| 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 # | |
| COMP | 2023-10-24 13:30 |
Aichi | Nagoya Univ. Venture Business Lab. | An algorithm for the secure total domination problem in proper interval graphs Toru Araki, Yasufumi Aita (Gunma Univ.)  COMP2023-11 |
A subset $S$ of vertices of $G$ is a total dominating set if, for any vertex $v$, there is a vertex in $S$ adjacent to $... [more] | COMP2023-11 pp.1-8 |
| COMP | 2023-03-02 14:45 |
Tokyo | Ochanomizu University | Correcting the algorithm for a minimum secure dominating set of proper interval graphs Toru Araki, Ryuya Saito (Gunma Univ.) COMP2022-36 |
In [A simple algorithm for secure domination in proper interval graphs, Discrete Applied Mathematics 260 (2019) 289--293... [more] | COMP2022-36 pp.16-20 |
| R | 2021-07-17 13:25 |
Online | Virtual | Numerical Analysis for Inspection Policies which Minimize the Expected Cost Rate Satoshi Mizutani, Toshio Nakagawa (AIT) R2021-17 |
We consider some modified sequential inspection policies which minimize the expected cost rates and show its numerical ... [more] |
R2021-17 pp.7-11 |
| COMP | 2019-09-02 16:00 |
Okayama | Tsushima Campus, Okayama University | Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-16 |
This research proposes algorithms that construct compressed data structures, called zero-suppressed binary decision dia... [more] |
COMP2019-16 p.33 |
| NLP | 2018-04-26 16:50 |
Kumamoto | Kumaoto Univ. | Interval Algorithm for Random Number Generation in the Case of Markov Coin Tossings Yasutada Oohama (Univ. Electro-Communications) NLP2018-12 |
In this paper we analyze the interval algorithm for random number generation proposed by Han and Hoshi in the case of M... [more] |
NLP2018-12 pp.53-58 |
| IBISML | 2018-03-06 10:25 |
Fukuoka | Nishijin Plaza, Kyushu University | Using local minima to accelerate Krawczyk-Hansen global optimization Hiroaki Takada (Univ. of Tokyo), Kazuki Yoshizoe (RIKEN), Daisuke Ishii (Univ. of Fukui), Koji Tsuda (Univ. of Tokyo) IBISML2017-99 |
Krawczyk-Hansen algorithm employs interval calculus and branch-and-bound search to solve a global optimization problem w... [more] | IBISML2017-99 pp.63-70 |
| ISEC, COMP | 2017-12-21 11:00 |
Kochi | Eikokuji Campus, Kochi University of Technology | Space Efficient Algorithms for Maximum (Weight) Independent Set on Circular Arcs Shohei Urakawa (Kobe Univ.), Tom C. van der Zanden (Utrecht Univ.), Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST) ISEC2017-74 COMP2017-28 |
Recently，due to increase of the capacity of storages，we require space efficient algorithms with a limited workspace for ... [more] | ISEC2017-74 COMP2017-28 pp.11-18 |
| COMP | 2017-10-27 15:50 |
Tokyo | Exploration of dynamic tori by mobile agents Tsuyoshi Gotoh, Yuichi Sudo (Osaka Univ), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP2017-25 |
Mobile agents (agents) are entities which can move autonomously in a networked system and execute actions at nodes they ... [more] | COMP2017-25 pp.37-44 |
|
| COMP | 2017-08-18 15:55 |
Aomori | Secure Domination in Proper Interval Graphs Toru Araki, Hiroka Miyazaki (Gunma Univ.) COMP2017-18 |
A subset $S$ of vertices in a graph $G$ is a secure dominating set of $G$ if $S$ is a dominating set of $G$ and, for eac... [more] | COMP2017-18 pp.41-46 |
|
| COMP | 2015-04-23 13:10 |
Miyagi | Algorithms for Dominating Set Reconfiguration Problem Arash Haddadan (Univ. of Waterloo), Takehiro Ito (Tohoku Univ.), Amer E. Mouawad, Naomi Nishimura (Univ. of Waterloo), Hirotaka Ono (Kyushu Univ.), Akira Suzuki (Tohoku Univ.), Youcef Tebbal (Univ. of Waterloo) COMP2015-1 |
Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given th... [more] |
COMP2015-1 pp.1-7 |
|
| MSS, CAS, IPSJ-AL [detail] | 2013-11-07 09:55 |
Iwate | A Note on Two-Directional Orthogonal Ray Graphs and Related Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2013-65 MSS2013-44 |
An orthogonal ray graph is an intersection graph of horizontal and vertical rays (half-lines) in the plane. An orthogona... [more] | CAS2013-65 MSS2013-44 pp.99-104 |
|
| SS, MSS | 2012-01-27 09:00 |
Kochi | Kochi City Culture-Plaza Cul-Port | [Invited Talk]
Research Cases on Interval Constraint Programming
-- A Projection Method for Under-Constrained Problems and a Precise Simulation Method for Hybrid Systems -- Daisuke Ishii (NII) MSS2011-67 SS2011-52 |
Interval constraint programming is a framework for describing various phenomena with constraints that involve variables ... [more] | MSS2011-67 SS2011-52 pp.73-77 |
| NC | 2012-01-27 09:55 |
Hokkaido | Future University Hakodate | A Study on Approximate Probabilistic Reasoning Algorithm for assuring and correcting accuracy results on Bayesian Networks Shuhei Wakasaki, Daisuke Kitakoshi, Masato Suzuki (TNCT) NC2011-110 |
In this paper, we propose an approximate probabilistic reasoning algorithm using the connecting structures of Bayesian n... [more] | NC2011-110 pp.77-82 |
| NC, MBE (Joint) |
2011-03-07 16:00 |
Tokyo | Tamagawa University | Emergence of Autonomic Transfer Proprieties by Learning Efficient Codes from Heartbeat Intervals Fausto Lucena (Nagoya Univ.), Allan Kardec Barros (Federal Univ. Of Maranhao), Noboru Ohnishi (Nagoya Univ.) NC2010-153 |
We present a generative model of the heartbeat intervals that captures the variations underlying the cardiac rhythm. Und... [more] | NC2010-153 pp.153-158 |
| IT, ISEC, WBS | 2010-03-04 09:00 |
Nagano | Nagano-Engineering Campus, Shinshu University | New Implementation and Evaluation of Knuth-Yao Algorithm and Interval Algorithm Shogo Takahashi, Hirosuke Yamamoto (Univ. of Tokyo) IT2009-89 ISEC2009-97 WBS2009-68 |
In this paper, new implementation algorithms are proposed for Knuth-Yao algorithm and the Interval algorithm, which can... [more] |
IT2009-89 ISEC2009-97 WBS2009-68 pp.117-122 |
| MBE | 2007-09-20 13:25 |
Niigata | Nagaoka Univ. of Tech. | Development of drowsiness detecting algorithm by physiologic indices Takumi Miyazawa, Ichiro Fukumoto (NUT) MBE2007-45 |
Traffic accidents caused by drowsiness have become a large social problem. In this study, we aimed to develop a drowsine... [more] | MBE2007-45 pp.3-6 |
| COMP | 2007-09-20 13:50 |
Aichi | Bandwidth of Bipartite Permutation Graphs Ryuhei Uehara (JAIST) COMP2007-36 |
The bandwidth problem is to find a linear layout of vertices in a graph in such way that minimizes the maximum distance... [more] |
COMP2007-36 pp.29-34 |
|
| COMP | 2007-06-29 14:15 |
Hokkaido | Hokkaido University | Simple efficient algorithm for MPQ-tree of an interval graph Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara (JAIST) COMP2007-24 |
An MPQ-tree is an informative data structure for an interval graph. We propose a simple algorithm that constructs an MPQ... [more] | COMP2007-24 pp.49-54 |
| SANE | 2006-04-11 15:00 |
Overseas | Xidian Univ., Xi'an, China | Minimization of Search Interval Using Multiple Radars Masashi Shiraishi, Teruyuki Hara (Mitsubishi Electric) SANE2006-24 |
When operating radars, it is necessary to search all the required coverage. Besides, it is desirable that the search int... [more] | SANE2006-24 pp.127-132 |
| ICM, NS, CQ (Joint) |
2005-11-18 13:30 |
Shimane | Kunibiki-messe (Matsue city) | Packets Arrival Interval based Time Synchronization Akihiko Machizawa, Hiroshi Toriyama, Tsukasa Iwama (NICT) |
Many of distributed measurement and control applications are enhanced by having an accurate time; microsecond to sub-mi... [more] |
CQ2005-73 pp.35-40 |
[Return to Top Page]