( en | de | ru )

 

Disambiguation of "Nishino, Masaaki"

Author of the publication

copydeleteadd this publication to your clipboard
Sub-sentence Extraction Based on Combinatorial Optimization.

, , , and . ECIR, volume 7814 of Lecture Notes in Computer Science, page 812-815. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kazuaki Nishino

Masaaki Minakawa

Hiroji Nishino

Masaaki Hayashida

Masaaki Tsukamoto

 

Other publications of authors with the same name

Phase-Based Feature Matching Under Illumination Variances., , and . IEA/AIE, volume 4570 of Lecture Notes in Computer Science, page 94-104. Springer, (2007)Optimizing Network Reliability via Best-First Search over Decision Diagrams., , , , and . INFOCOM, page 1817-1825. IEEE, (2018)Efficient Network Reliability Evaluation for Client-Server Model., , , and . GLOBECOM, page 1-6. IEEE, (2021)Differentiable Inductive Logic Programming for Structured Examples., , and . AAAI, page 5034-5041. AAAI Press, (2021)BDD-Constrained A* Search: A Fast Method for Solving Constrained DAG Shortest-Path Problems., , , , , and . AAAI Workshops, volume WS-17 of AAAI Technical Report, AAAI Press, (2017)Dancing with Decision Diagrams: A Combined Approach to Exact Cover., , , and . AAAI, page 868-874. AAAI Press, (2017)Submodular Function Maximization Over Graphs via Zero-Suppressed Binary Decision Diagrams., , and . AAAI, page 1422-1430. AAAI Press, (2018)Generalization Analysis on Learning with a Concurrent Verifier., , and . NeurIPS, (2022)Numerical Optimization Methods based on Discrete Structure for Text Summarization and Relational Learning.. Kyoto University, Japan, (2014)Approximated ZDD Construction Considering Inclusion Relations of Models., , , , and . SEA², volume 11544 of Lecture Notes in Computer Science, page 265-282. Springer, (2019)