2008 |
21 | EE | Youichi Hanatani,
Takashi Horiyama,
Kazuo Iwama,
Suguru Tamaki:
New Graph Calculi for Planar Non-3-Colorable Graphs.
IEICE Transactions 91-A(9): 2301-2307 (2008) |
2006 |
20 | EE | Takashi Horiyama,
Kazuo Iwama,
Jun Kawahara:
Finite-State Online Algorithms and Their Automated Competitive Analysis.
ISAAC 2006: 71-80 |
19 | EE | Yuichi Asahiro,
Takashi Horiyama,
Kazuhisa Makino,
Hirotaka Ono,
Toshinori Sakuma,
Masafumi Yamashita:
How to collect balls moving in the Euclidean plane.
Discrete Applied Mathematics 154(16): 2247-2262 (2006) |
18 | EE | Youichi Hanatani,
Takashi Horiyama,
Kazuo Iwama:
Density condensation of Boolean formulas.
Discrete Applied Mathematics 154(16): 2263-2270 (2006) |
17 | EE | Nobuhiro Doi,
Takashi Horiyama,
Masaki Nakanishi,
Shinji Kimura:
Bit-Length Optimization Method for High-Level Synthesis Based on Non-linear Programming Technique.
IEICE Transactions 89-A(12): 3427-3434 (2006) |
2004 |
16 | EE | Nobuhiro Doi,
Takashi Horiyama,
Masaki Nakanishi,
Shinji Kimura:
Minimization of fractional wordlength on fixed-point conversion for high-level synthesis.
ASP-DAC 2004: 80-85 |
15 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Reasoning with ordered binary decision diagrams.
Discrete Applied Mathematics 142(1-3): 151-163 (2004) |
14 | EE | Yuichi Asahiro,
Takashi Horiyama,
Kazuhisa Makino,
Hirotaka Ono,
Toshinori Sakuma,
Masafumi Yamashita:
How to Collect Balls Moving in the Euclidean Plane.
Electr. Notes Theor. Comput. Sci. 91: 229-245 (2004) |
2003 |
13 | EE | Youichi Hanatani,
Takashi Horiyama,
Kazuo Iwama:
Density Condensation of Boolean Formulas.
SAT 2003: 69-77 |
12 | | Endre Boros,
Takashi Horiyama,
Toshihide Ibaraki,
Kazuhisa Makino,
Mutsunori Yagiura:
Finding Essential Attributes from Binary Data.
Ann. Math. Artif. Intell. 39(3): 223-257 (2003) |
11 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Translation among CNFs, characteristic models and ordered binary decision diagrams.
Inf. Process. Lett. 85(4): 191-198 (2003) |
2002 |
10 | EE | Shinji Kimura,
Takashi Horiyama,
Masaki Nakanishi,
Hirotsugu Kajihara:
Folding of logic functions and its application to look up table compaction.
ICCAD 2002: 694-697 |
9 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Ordered binary decision diagrams as knowledge-bases.
Artif. Intell. 136(2): 189-213 (2002) |
2001 |
8 | EE | Kazuhiro Nakamura,
Qiang Zhu,
Shinji Maruoka,
Takashi Horiyama,
Shinji Kimura,
Katsumasa Watanabe:
A real-time 64-monosyllable recognition LSI with learning mechanism.
ASP-DAC 2001: 31-32 |
7 | EE | Kazuhiro Nakamura,
Qiang Zhu,
Shinji Maruoka,
Takashi Horiyama,
Shinji Kimura,
Katsumasa Watanabe:
Speech recognition chip for monosyllables.
ASP-DAC 2001: 396-399 |
6 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams.
ISAAC 2001: 231-243 |
2000 |
5 | EE | Endre Boros,
Takashi Horiyama,
Toshihide Ibaraki,
Kazuhisa Makino,
Mutsunori Yagiura:
Finding Essential Attributes in Binary Data.
IDEAL 2000: 133-138 |
4 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Reasoning with Ordered Binary Decision Diagrams.
ISAAC 2000: 120-131 |
1999 |
3 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Ordered Binary Decision Diagrams as Knowledge-Bases.
ISAAC 1999: 83-92 |
2 | EE | Naofumi Takagi,
Takashi Horiyama:
A High-Speed Reduced-Size Adder Under Left-to-Right Input Arrival.
IEEE Trans. Computers 48(1): 76-80 (1999) |
1997 |
1 | | Takashi Horiyama,
Shuzo Yajima:
Exponential Lower Bounds on the Size of OBDDs Representing Integer Divistion.
ISAAC 1997: 163-172 |