default search action
Masaaki Nishino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima, Masaaki Nishino, Shuhei Denzumi, Shin-ichi Minato:
International Competition on Graph Counting Algorithms 2023. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(9): 1441-1451 (2024) - [c45]Masaaki Nishino, Kengo Nakamura, Norihito Yasuda:
Understanding the Impact of Introducing Constraints at Inference Time on Generalization Error. ICML 2024 - [c44]Kengo Nakamura, Masaaki Nishino, Shuhei Denzumi:
Single Family Algebra Operation on BDDs and ZDDs Leads to Exponential Blow-Up. ISAAC 2024: 52:1-52:17 - [i12]Kengo Nakamura, Masaaki Nishino, Shuhei Denzumi:
Single Family Algebra Operation on ZDDs Leads To Exponential Blow-Up. CoRR abs/2403.05074 (2024) - 2023
- [c43]Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato:
Exact and Efficient Network Reliability Evaluation per Outage Scale. ICC 2023: 4564-4570 - [c42]Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato:
A Fast and Exact Evaluation Algorithm for the Expected Number of Connected Nodes: an Enhanced Network Reliability Measure. INFOCOM 2023: 1-10 - [c41]Kengo Nakamura, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato:
CompDP: A Framework for Simultaneous Subgraph Counting Under Connectivity Constraints. SEA 2023: 11:1-11:20 - [i11]Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima, Masaaki Nishino, Shuhei Denzumi, Shin-ichi Minato:
International Competition on Graph Counting Algorithms 2023. CoRR abs/2309.07381 (2023) - [i10]Ryosuke Sugiura, Masaaki Nishino, Norihito Yasuda, Yutaka Kamamoto, Takehiro Moriya:
Optimal Construction of N-bit-delay Almost Instantaneous Fixed-to-Variable-Length Codes. CoRR abs/2311.02797 (2023) - 2022
- [c40]Ryoma Onaka, Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda, Shinsaku Sakaue:
Exact and Scalable Network Reliability Evaluation for Probabilistic Correlated Failures. GLOBECOM 2022: 5547-5552 - [c39]Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda:
Impact of Link Availability Uncertainty on Network Reliability: Analyses with Variances. ICC 2022: 2713-2719 - [c38]Hikaru Tomonari, Masaaki Nishino, Akihiro Yamamoto:
Robustness Evaluation of Text Classification Models Using Mathematical Optimization and Its Application to Adversarial Training. AACL/IJCNLP (Findings) 2022: 327-333 - [c37]Masaaki Nishino, Kengo Nakamura, Norihito Yasuda:
Generalization Analysis on Learning with a Concurrent Verifier. NeurIPS 2022 - [i9]Masaaki Nishino, Kengo Nakamura, Norihito Yasuda:
Generalization Analysis on Learning with a Concurrent Verifier. CoRR abs/2210.05331 (2022) - 2021
- [c36]Hikaru Shindo, Masaaki Nishino, Akihiro Yamamoto:
Differentiable Inductive Logic Programming for Structured Examples. AAAI 2021: 5034-5041 - [c35]Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda:
Efficient Network Reliability Evaluation for Client-Server Model. GLOBECOM 2021: 1-6 - [c34]Masaaki Nishino, Norihito Yasuda, Kengo Nakamura:
Compressing Exact Cover Problems with Zero-suppressed Binary Decision Diagrams. IJCAI 2021: 1996-2004 - [i8]Hikaru Shindo, Masaaki Nishino, Akihiro Yamamoto:
Differentiable Inductive Logic Programming for Structured Examples. CoRR abs/2103.01719 (2021) - [i7]Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda:
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions. CoRR abs/2110.05184 (2021) - 2020
- [j4]Teruji Sugaya, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato:
Tree Decomposition-based Approach for Compiling Independent Sets. J. Inf. Process. 28: 354-368 (2020) - [c33]Katsuki Chousa, Masaaki Nagata, Masaaki Nishino:
SpanAlign: Sentence Alignment Method based on Cross-Language Span Prediction and ILP. COLING 2020: 4750-4761 - [c32]Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi
, Akihiro Yamamoto:
Metric Learning for Ordered Labeled Trees with pq-grams. ECAI 2020: 1475-1482 - [c31]Masaaki Nagata, Katsuki Chousa, Masaaki Nishino:
A Supervised Word Alignment Method based on Cross-Language Span Prediction using Multilingual BERT. EMNLP (1) 2020: 555-565 - [c30]Hiroki Ikeuchi, Akio Watanabe, Tsutomu Hirao, Makoto Morishita, Masaaki Nishino, Yoichi Matsuo
Recovery command generation towards automatic recovery in ICT systems by Seq2Seq learning. NOMS 2020: 1-6 - [c29]Yu Nakahata
Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams. SEA 2020: 9:1-9:14 - [c28]Kengo Nakamura
Variable Shift SDD: A More Succinct Sentential Decision Diagram. SEA 2020: 22:1-22:13 - [i6]Hikaru Shindo, Masaaki Nishino, Yasuaki Kobayashi
Metric Learning for Ordered Labeled Trees with pq-grams. CoRR abs/2003.03960 (2020) - [i5]Hiroki Ikeuchi, Akio Watanabe, Tsutomu Hirao, Makoto Morishita, Masaaki Nishino, Yoichi Matsuo, Keishiro Watanabe:
Recovery command generation towards automatic recovery in ICT systems by Seq2Seq learning. CoRR abs/2003.10784 (2020) - [i4]Kengo Nakamura, Shuhei Denzumi, Masaaki Nishino:
Variable Shift SDD: A More Succinct Sentential Decision Diagram. CoRR abs/2004.02502 (2020) - [i3]Masaaki Nagata, Katsuki Chousa, Masaaki Nishino:
A Supervised Word Alignment Method based on Cross-Language Span Prediction using Multilingual BERT. CoRR abs/2004.14516 (2020) - [i2]Katsuki Chousa, Masaaki Nagata, Masaaki Nishino:
Bilingual Text Extraction as Reading Comprehension. CoRR abs/2004.14517 (2020)
2010 – 2019
- 2019
- [c27]Masaaki Nishino, Sho Takase, Tsutomu Hirao, Masaaki Nagata:
Generating Natural Anagrams: Towards Language Generation Under Hard Combinatorial Constraints. EMNLP/IJCNLP (1) 2019: 6407-6411 - [c26]Kotaro Matsuda, Shuhei Denzumi, Kengo Nakamura, Masaaki Nishino, Norihito Yasuda:
Approximated ZDD Construction Considering Inclusion Relations of Models. SEA² 2019: 265-282 - 2018
- [c25]Shinsaku Sakaue, Masaaki Nishino, Norihito Yasuda:
Submodular Function Maximization Over Graphs via Zero-Suppressed Binary Decision Diagrams. AAAI 2018: 1422-1430 - [c24]Hikaru Shindo, Masaaki Nishino, Akihiro Yamamoto:
Using Binary Decision Diagrams to Enumerate Inductive Logic Programming Solutions. ILP Up-and-Coming / Short Papers 2018: 52-67 - [c23]Masaaki Nishino, Takeru Inoue, Norihito Yasuda, Shin-ichi Minato, Masaaki Nagata:
Optimizing Network Reliability via Best-First Search over Decision Diagrams. INFOCOM 2018: 1817-1825 - [c22]Shinsaku Sakaue, Tsutomu Hirao, Masaaki Nishino, Masaaki Nagata:
Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function. NAACL-HLT 2018: 1737-1746 - 2017
- [j3]Fumito Takeuchi, Masaaki Nishino, Norihito Yasuda, Takuya Akiba, Shin-ichi Minato, Masaaki Nagata:
BDD-Constrained A* Search: A Fast Method for Solving Constrained Shortest-Path Problems. IEICE Trans. Inf. Syst. 100-D(12): 2945-2952 (2017) - [c21]Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato, Masaaki Nagata:
Dancing with Decision Diagrams: A Combined Approach to Exact Cover. AAAI 2017: 868-874 - [c20]Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato, Masaaki Nagata:
Compiling Graph Substructures into Sentential Decision Diagrams. AAAI 2017: 1213-1221 - [c19]Fumito Takeuchi, Masaaki Nishino, Norihito Yasuda, Takuya Akiba, Shin-ichi Minato, Masaaki Nagata:
BDD-Constrained A* Search: A Fast Method for Solving Constrained DAG Shortest-Path Problems. AAAI Workshops 2017 - [c18]Tsutomu Hirao, Masaaki Nishino, Masaaki Nagata:
Oracle Summaries of Compressive Summarization. ACL (2) 2017: 275-280 - [c17]Masaaki Nishino, Kei Amii, Akihiro Yamamoto:
On the Sizes of Decision Diagrams Representing the Set of All Parse Trees of a Context-free Grammar. AMBN 2017: 153-164 - [c16]Tsutomu Hirao, Masaaki Nishino, Jun Suzuki
Enumeration of Extractive Oracle Summaries. EACL (1) 2017: 386-396 - [i1]Tsutomu Hirao, Masaaki Nishino, Jun Suzuki, Masaaki Nagata:
Enumeration of Extractive Oracle Summaries. CoRR abs/1701.01614 (2017) - 2016
- [c15]Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato, Masaaki Nagata:
Zero-Suppressed Sentential Decision Diagrams. AAAI 2016: 1058-1066 - [c14]Masaaki Nishino, Jun Suzuki
Phrase Table Pruning via Submodular Function Maximization. ACL (2) 2016 - [c13]Xun Wang, Masaaki Nishino, Tsutomu Hirao, Katsuhito Sudoh, Masaaki Nagata:
Exploring Text Links for Coherent Multi-Document Summarization. COLING 2016: 213-223 - 2015
- [j2]Tsutomu Hirao, Masaaki Nishino, Yasuhisa Yoshida, Jun Suzuki
Summarizing a Document by Trimming the Discourse Tree. IEEE ACM Trans. Audio Speech Lang. Process. 23(11): 2081-2092 (2015) - [c12]Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato, Masaaki Nagata:
BDD-Constrained Search: A Unified Approach to Constrained Shortest Path Problems. AAAI 2015: 1219-1225 - [c11]Masaaki Nishino, Norihito Yasuda, Tsutomu Hirao, Shin-ichi Minato, Masaaki Nagata:
A Dynamic Programming Algorithm for Tree Trimming-based Text Summarization. HLT-NAACL 2015: 462-471 - 2014
- [b1]Masaaki Nishino:
Numerical Optimization Methods based on Discrete Structure for Text Summarization and Relational Learning. Kyoto University, Japan, 2014 - [c10]Masaaki Nishino, Akihiro Yamamoto, Masaaki Nagata:
A Sparse Parameter Learning Method for Probabilistic Logic Programs. StarAI@AAAI 2014 - [c9]Norihito Yasuda, Masaaki Nishino, Shin-ichi Minato:
On the Size of the Zero-Suppressed Binary Decision Diagram that Represents All the Subtrees in a Tree. PAKDD Workshops 2014: 504-510 - [c8]Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato, Masaaki Nagata:
Accelerating Graph Adjacency Matrix Multiplications with Adjacency Forest. SDM 2014: 1073-1081 - 2013
- [j1]Masaaki Nishino, Norihito Yasuda, Tsutomu Hirao, Jun Suzuki, Masaaki Nagata:
Lagrangian Relaxation for Scalable Text Summarization while Maximizing Multiple Objectives. Inf. Media Technol. 8(4): 1017-1025 (2013) - [c7]Masaaki Nishino, Norihito Yasuda, Tsutomu Hirao, Jun Suzuki
Text Summarization while Maximizing Multiple Objectives with Lagrangian Relaxation. ECIR 2013: 772-775 - [c6]Norihito Yasuda, Masaaki Nishino, Tsutomu Hirao, Masaaki Nagata:
Sub-sentence Extraction Based on Combinatorial Optimization. ECIR 2013: 812-815 - [c5]Tsutomu Hirao, Yasuhisa Yoshida, Masaaki Nishino, Norihito Yasuda, Masaaki Nagata:
Single-Document Summarization as a Tree Knapsack Problem. EMNLP 2013: 1515-1520 - 2012
- [c4]Norihito Yasuda, Masaaki Nishino, Tsutomu Hirao, Jun Suzuki
A Query-Focused Summarization Method that Guarantees the Inclusion of Query Words. DEXA Workshops 2012: 126-130 - 2010
- [c3]Masaaki Nishino, Yukihiro Nakamura, Takashi Yagi, Shin-yo Muto, Masanobu Abe:
A location predictor based on dependencies between multiple lifelog data. GIS-LBSN 2010: 11-17 - [c2]Madori Ikeda, Masaaki Nishino, Koichiro Doi, Akihiro Yamamoto, Susumu Hayashi:
Semantics of a Graphical Model for Representing Hypotheses and a System Supporting the Management of Hypotheses. KICSS 2010: 32-43
2000 – 2009
- 2007
- [c1]Masaaki Nishino, Atsuto Maki, Takashi Matsuyama:
Phase-Based Feature Matching Under Illumination Variances. IEA/AIE 2007: 94-104
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 21:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: