Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IN, NV (Joint) |
2012-07-19 17:10 |
Hokkaido |
Hokkaido Univ. |
[Invited Talk]
Analyzing power distribution networks by frontier-based method Takeru Inoue (JST), Keiji Takano (Tokyo IT), Takayuki Watanabe (Waseda Univ.), Jun Kawahara (JST), Ryo Yoshinaka (Kyoto Univ.), Akihiro Kishimoto (Tokyo IT), Koji Tsuda (AIST), Shin-ichi Minato (Hokkaido Univ.), Yasuhiro Hayashi (Waseda Univ.) IN2012-39 |
[more] |
IN2012-39 pp.37-42 |
COMP |
2012-06-21 09:30 |
Hokkaido |
Hokkaido University |
Generalization of ZDD Construction Algorithms for Enumerating and Indexing the Solutions of Combinatorial Problems Jun Kawahara (JST), Shin-ichi Minato (Hokkaido Univ.) COMP2012-12 |
There are various combinatorial problems whose solutions can be represented as a family of sets. The Zero-suppressed Bi... [more] |
COMP2012-12 pp.1-7 |
COMP |
2012-06-21 09:55 |
Hokkaido |
Hokkaido University |
Rich Operations for Manipulating Sequence Binary Decision Diagrams Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato (Hokkaido Univ.) COMP2012-13 |
Manipulating large sequence data is important problem in string processing field. In this paper, we deal with sequence b... [more] |
COMP2012-13 pp.9-16 |
COMP |
2012-04-27 13:20 |
Osaka |
Osaka Prefecture University |
Sequence Binary Decision Diagrams with Mapping Edges Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.) COMP2012-4 |
A Binary Decision Diagram (BDD) gives efficient boolean function manipulations. The memory efficiency of BDDs depends on... [more] |
COMP2012-4 pp.23-28 |
IN, NV (Joint) |
2011-07-21 16:40 |
Hokkaido |
Hokkaido University |
[Invited Talk]
Title Shin-ichi Minato (Hokkaido Univ.) IN2011-54 |
(Advance abstract in Japanese is available) [more] |
IN2011-54 pp.51-56 |
IN, NV (Joint) |
2011-07-21 17:10 |
Hokkaido |
Hokkaido University |
Entwork Reliability Evaluation Using Efficient Path Enumeration ALgorithms Toshiki Saitoh, Jun Kawahara, Ryo Yoshinaka, Takeru Inoue (JST), Shin-ichi Minato (Hokkaido Univ.) IN2011-55 |
Recently, novel algorithms that enumerate all possible paths on a graph have been proposed. They commonly take advantage... [more] |
IN2011-55 pp.57-62 |
IN, NV (Joint) |
2011-07-21 17:35 |
Hokkaido |
Hokkaido University |
Server load balancing with a URL shortener in Tohoku earthquake Takeru Inoue (JST), Shin-ichi Minato (Hokkaido Univ./JST) IN2011-56 |
Several servers providing disaster-related information often went down after Tohoku earthquake and tsunami, due to "flas... [more] |
IN2011-56 pp.63-68 |
RECONF |
2011-05-12 16:30 |
Hokkaido |
Hokkaido Univ. (Faculty of Eng., B3 Bldg.) |
[Invited Talk]
ERATO MINATO Discrete Structure Manipulation System Project and Current Work on System Design Area Shin-ichi Minato (Hokkaido Univ.) RECONF2011-11 |
[more] |
RECONF2011-11 pp.61-66 |
COMP |
2011-04-22 10:50 |
Kyoto |
Kyoto University |
Construction of a SeqBDD representing a set of reversed sequences Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.) COMP2011-3 |
A trie is a data structure representing a set of sequences by sharing the same prefixes between sequences. Thanks to thi... [more] |
COMP2011-3 pp.17-23 |
COMP |
2011-04-22 11:25 |
Kyoto |
Kyoto University |
$\pi$DDs(PiDDs): Binary Decision Diagrams for Manipulating Sets of Combinations Shin-ichi Minato (Hokkaido Univ.) COMP2011-4 |
Permutations and combinations are a couple of basic concepts in elementary combinatorics. Permutations appear in various... [more] |
COMP2011-4 pp.25-32 |
IBISML |
2011-03-28 16:10 |
Osaka |
Nakanoshima Center, Osaka Univ. |
Comparison of ZDD-Vectors and WZDDs for Frequent Pattern Mining Haruya Iwasaki, Shin-ichi Minato (Hokkaido Univ.) |
(Advance abstract in Japanese is available) [more] |
|
IBISML |
2011-03-28 16:50 |
Osaka |
Nakanoshima Center, Osaka Univ. |
Enumerating Feature-Sets with Submodularity Yoshinobu Kawahara (Osaka Univ.), Koji Tsuda (AIST), Takashi Washio (Osaka Univ.), Akiko Takeda (Keio Univ.), Shin-ichi Minato (Hokkaido Univ.) IBISML2010-113 |
Selecting relevant features is a fundamental task in machine learning. Although many approaches have been investigated s... [more] |
IBISML2010-113 pp.63-68 |
IBISML |
2010-06-15 16:05 |
Tokyo |
Takeda Hall, Univ. Tokyo |
An EM algorithm on binary decision diagrams with order encoding for propositional logic-based probabilistic models Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato (Tokyo Inst. of Tech.), Shin-ichi Minato (Hokkaido Univ) IBISML2010-23 |
We propose an EM algorithm on Binary Decision Diagrams (BDDs) with order encoding for propositional logic-based probabil... [more] |
IBISML2010-23 pp.155-165 |
COMP, IPSJ-AL |
2010-05-19 14:30 |
Ishikawa |
Japan Advanced Institute of Science and Technology |
Efficient Pattern Matching for Acyclic Regular Expressions Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura (Hokkaido Univ.) COMP2010-11 |
A regular expression is \name{acyclic} if it is over the basis in $\Sigma$, dot ``$\cdot$'', and union ``$|$''. In this ... [more] |
COMP2010-11 pp.23-29 |
IPSJ-SLDM, VLD, CPSY, RECONF [detail] |
2010-01-26 11:15 |
Kanagawa |
Keio Univ (Hiyoshi Campus) |
Development of Interdisciplinary Research Environment by Collaboration of e-Learning and Remote FPGA Jaeseong Kim, Shingo Yoshizawa, Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga (Hokkaido Univ.) VLD2009-74 CPSY2009-56 RECONF2009-59 |
Field programmable gate array (FPGA) can reconfigure logic circuits after production, which is embedded into electric in... [more] |
VLD2009-74 CPSY2009-56 RECONF2009-59 pp.31-34 |
IPSJ-SLDM, VLD, CPSY, RECONF [detail] |
2010-01-27 12:40 |
Kanagawa |
Keio Univ (Hiyoshi Campus) |
An efficient hardware-oriented algorithm for regular expression matching based on parallel bit-distribution Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga (Hokkaido Univ.) VLD2009-90 CPSY2009-72 RECONF2009-75 |
In this paper, we study the regular expression matching problem for fast data stream processing. We present an efficient... [more] |
VLD2009-90 CPSY2009-72 RECONF2009-75 pp.131-136 |
COMP |
2009-05-26 09:30 |
Saitama |
Saitama Univ. |
* Hiromu Suzuki, Shin-ichi Minato (Hokkaido Univ.) COMP2009-9 |
Binary Decision Diagram (BDD) is a graph-based representation of Boolean
function. BDDs can compactly represent and eff... [more] |
COMP2009-9 pp.1-7 |
PRMU, DE |
2008-06-19 15:00 |
Hokkaido |
Otaru-Shimin-Kaikan |
Knowledge Discovery and Compression by Using Zero-suppressed BDDs Ryutaro Kurai, Shin-ichi Minato, Thomas Zeugmann (Hokkaido Univ.) DE2008-10 PRMU2008-28 |
In the present paper we propose a new method for clustering text data by using
the Normalized Compression Distance and ... [more] |
DE2008-10 PRMU2008-28 pp.53-58 |
AI |
2007-05-31 14:00 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
[Invited Talk]
Recent Topics on Data Mining and Knoledge Discovery Using Binary Decision Diagrams Shin-ichi Minato (Hokkaido Univ.) AI2007-6 |
Binary Decision Diagrams (BDDs) are the efficient data structure for representing Boolean functions on the main memory. ... [more] |
AI2007-6 pp.27-32 |
COMP |
2007-03-05 14:20 |
Tokyo |
The University of Electro-Communications |
A Theoretical Study on Variable Ordering of Zero-suppressed BDDs for Frequent Item Set Mining Shin-ichi Minato (Hokkaido Univ.) |
Recently, an efficient method has been proposed to use Zero-suppressed Binary Decision Diagrams \linebreak (ZBDDs) for e... [more] |
COMP2006-55 pp.37-42 |