 | 2009 |
| 13 |  | Tomonari Masada,
Daiji Fukagawa,
Atsuhiro Takasu,
Tsuyoshi Hamada,
Yuichiro Shibata,
Kiyoshi Oguri:
Dynamic hyperparameter optimization for bayesian topical trend analysis.
CIKM 2009: 1831-1834 |
| 12 |  | Hisashi Kurasawa,
Daiji Fukagawa,
Atsuhiro Takasu,
Jun Adachi:
Maximal metric margin partitioning for similarity search indexes.
CIKM 2009: 1887-1890 |
| 11 |  | Atsuhiro Takasu,
Daiji Fukagawa,
Tatsuya Akutsu:
Latent Topic Extraction from Relational Table for Record Matching.
Discovery Science 2009: 449-456 |
| 10 |  | Daiji Fukagawa,
Tatsuya Akutsu,
Atsuhiro Takasu:
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees.
SPIRE 2009: 7-17 |
| 2008 |
| 9 |  | Tatsuya Akutsu,
Daiji Fukagawa,
Atsuhiro Takasu:
Improved approximation of the largest common subtree of two unordered trees of bounded height.
Inf. Process. Lett. 109(2): 165-170 (2008) |
| 2007 |
| 8 |  | Tatsuya Akutsu,
Daiji Fukagawa:
Inferring a Chemical Structure from a Feature Vector Based on Frequency of Labeled Paths and Small Fragments.
APBC 2007: 165-174 |
| 7 |  | Atsuhiro Takasu,
Daiji Fukagawa,
Tatsuya Akutsu:
Statistical Learning Algorithm for Tree Similarity.
ICDM 2007: 667-672 |
| 2006 |
| 6 |  | Tatsuya Akutsu,
Daiji Fukagawa,
Atsuhiro Takasu:
Approximating Tree Edit Distance Through String Edit Distance.
ISAAC 2006: 90-99 |
| 5 |  | Daiji Fukagawa,
Tatsuya Akutsu:
Fast Algorithms for Comparison of Similar Unordered Trees.
Int. J. Found. Comput. Sci. 17(3): 703-729 (2006) |
| 2005 |
| 4 |  | Tatsuya Akutsu,
Daiji Fukagawa:
Inferring a Graph from Path Frequency.
CPM 2005: 371-382 |
| 3 |  | Daiji Fukagawa,
Tatsuya Akutsu:
Performance analysis of a greedy algorithm for inferring Boolean functions.
Inf. Process. Lett. 93(1): 7-12 (2005) |
| 2004 |
| 2 |  | Daiji Fukagawa,
Tatsuya Akutsu:
Fast Algorithms for Comparison of Similar Unordered Trees.
ISAAC 2004: 452-463 |
| 2003 |
| 1 |  | Daiji Fukagawa,
Tatsuya Akutsu:
Performance Analysis of a Greedy Algorithm for Inferring Boolean Functions.
Discovery Science 2003: 114-127 |