( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
BDD-Constrained A* Search: A Fast Method for Solving Constrained DAG Shortest-Path Problems.

, , , , , и . AAAI Workshops, том WS-17 из AAAI Technical Report, AAAI Press, (2017)

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.

Kazuaki Nishino

Masaaki Minakawa

Hiroji Nishino

Masaaki Hayashida

Masaaki Tsukamoto

 

Другие публикации лиц с тем же именем

On the Size of the Zero-Suppressed Binary Decision Diagram that Represents All the Subtrees in a Tree., , и . PAKDD Workshops, том 8643 из Lecture Notes in Computer Science, стр. 504-510. Springer, (2014)Tree Decomposition-based Approach for Compiling Independent Sets., , , и . J. Inf. Process., (2020)Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function., , , и . NAACL-HLT, стр. 1737-1746. Association for Computational Linguistics, (2018)A Dynamic Programming Algorithm for Tree Trimming-based Text Summarization., , , , и . HLT-NAACL, стр. 462-471. The Association for Computational Linguistics, (2015)Single-Document Summarization as a Tree Knapsack Problem., , , , и . EMNLP, стр. 1515-1520. ACL, (2013)Sub-sentence Extraction Based on Combinatorial Optimization., , , и . ECIR, том 7814 из Lecture Notes in Computer Science, стр. 812-815. Springer, (2013)Bilingual Text Extraction as Reading Comprehension., , и . CoRR, (2020)Single Family Algebra Operation on ZDDs Leads To Exponential Blow-Up., , и . CoRR, (2024)Summarizing a Document by Trimming the Discourse Tree., , , , , и . IEEE ACM Trans. Audio Speech Lang. Process., 23 (11): 2081-2092 (2015)A Fast and Exact Evaluation Algorithm for the Expected Number of Connected Nodes: an Enhanced Network Reliability Measure., , , , и . INFOCOM, стр. 1-10. IEEE, (2023)