Single-document summarization as a tree knapsack problem T Hirao, Y Yoshida, M Nishino, N Yasuda, M Nagata Proceedings of the 2013 conference on empirical methods in natural language …, 2013 | 103 | 2013 |

Zero-Suppressed Sentential Decision Diagrams M Nishino, N Yasuda, S Minato, M Nagata AAAI, 1058-1066, 2016 | 21 | 2016 |

Compiling Graph Substructures into Sentential Decision Diagrams M Nishino, N Yasuda, S Minato, M Nagata AAAI, 1213 -- 1221, 2017 | 16 | 2017 |

Summarizing a document by trimming the discourse tree T Hirao, M Nishino, Y Yoshida, J Suzuki, N Yasuda, M Nagata IEEE/ACM Transactions on Audio, Speech, and Language Processing 23 (11 …, 2015 | 16 | 2015 |

A location predictor based on dependencies between multiple lifelog data M Nishino, Y Nakamura, T Yagi, S Muto, M Abe Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Location …, 2010 | 15 | 2010 |

Exploring text links for coherent multi-document summarization X Wang, M Nishino, T Hirao, K Sudoh, M Nagata Proceedings of COLING 2016, the 26th International Conference on …, 2016 | 14 | 2016 |

Restaurant recommendation service using lifelogs H Tezuka, K Ito, T Murayama, S Seko, M Nishino, SY Muto, M Abe NTT Technical Review 9 (1), 2011 | 13 | 2011 |

Enumeration of extractive oracle summaries T Hirao, M Nishino, J Suzuki, M Nagata arXiv preprint arXiv:1701.01614, 2017 | 10 | 2017 |

BDD-constrained search: A unified approach to constrained shortest path problems M Nishino, N Yasuda, S Minato, M Nagata Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence …, 2015 | 9 | 2015 |

Oracle summaries of compressive summarization T Hirao, M Nishino, M Nagata Proceedings of the 55th Annual Meeting of the Association for Computational …, 2017 | 6 | 2017 |

A dynamic programming algorithm for tree trimming-based text summarization M Nishino, N Yasuda, T Hirao, S Minato, M Nagata Proceedings of the 2015 Conference of the North American Chapter of the …, 2015 | 6 | 2015 |

Accelerating graph adjacency matrix multiplications with adjacency forest M Nishino, N Yasuda, S Minato, M Nagata Proceedings of the 2014 SIAM International Conference on Data Mining, 1073-1081, 2014 | 6 | 2014 |

Fast compilation of graph substructures for counting and enumeration T Sugaya, M Nishino, N Yasuda, S Minato Behaviormetrika 45 (2), 423-450, 2018 | 4 | 2018 |

A sparse parameter learning method for probabilistic logic programs M Nishino, A Yamamoto, M Nagata Proceedings of the 13th AAAI Conference on Statistical Relational AI, 76-82, 2014 | 4 | 2014 |

Text summarization while maximizing multiple objectives with lagrangian relaxation M Nishino, N Yasuda, T Hirao, J Suzuki, M Nagata European Conference on Information Retrieval, 772-775, 2013 | 4 | 2013 |

Provable fast greedy compressive summarization with any monotone submodular function S Sakaue, T Hirao, M Nishino, M Nagata Proceedings of the 2018 Conference of the North American Chapter of the …, 2018 | 2 | 2018 |

Optimizing network reliability via best-first search over decision diagrams M Nishino, T Inoue, N Yasuda, SI Minato, M Nagata IEEE INFOCOM 2018-IEEE Conference on Computer Communications, 1817-1825, 2018 | 2 | 2018 |

Submodular function maximization over graphs via zero-suppressed binary decision diagrams S Sakaue, M Nishino, N Yasuda AAAI, 2018 | 2 | 2018 |

Sequence alignment as a set partitioning problem M Nishino, J Suzuki, S Umetani, T Hirao, M Nagata 自然言語処理 23 (2), 175-194, 2016 | 2 | 2016 |

Lagrangian relaxation for scalable text summarization while maximizing multiple objectives M Nishino, N Yasuda, T Hirao, J Suzuki, M Nagata Information and Media Technologies 8 (4), 1017-1025, 2013 | 2 | 2013 |