default search action
Masakazu Ishihata
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i9]Mitsuka Kiyohara, Masakazu Ishihata:
A Constraint Programming Approach to Fair High School Course Scheduling. CoRR abs/2408.12032 (2024) - [i8]Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga:
Packed Acyclic Deterministic Finite Automata. CoRR abs/2410.07602 (2024) - 2023
- [c25]Masakazu Ishihata:
The Bag-Based Search: A Meta-Algorithm to Construct Tractable Logical Circuits for Graphs Based on Tree Decomposition. COCOA (2) 2023: 337-350 - [c24]Yuiko Tsunomori, Masakazu Ishihata, Hiroaki Sugiyama:
Time-Considerable Dialogue Models via Reranking by Time Dependency. EMNLP (Findings) 2023: 5136-5149 - 2022
- [c23]Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl
, Takaaki Nishimoto:
Computing NP-Hard Repetitiveness Measures via MAX-SAT. ESA 2022: 12:1-12:16 - [c22]Masakazu Ishihata, Fumiya Tokumasu:
Solving and Generating Nagareru Puzzles. SEA 2022: 2:1-2:17 - [i7]Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl
Computing NP-hard Repetitiveness Measures via MAX-SAT. CoRR abs/2207.02571 (2022) - 2021
- [c21]Koh Takeuchi, Masaaki Imaizumi, Shunsuke Kanda, Yasuo Tabei, Keisuke Fujii, Ken Yoda, Masakazu Ishihata, Takuya Maekawa:
Fréchet Kernel for Trajectory Data Analysis. SIGSPATIAL/GIS 2021: 221-224 - [c20]Kyohei Atarashi, Masakazu Ishihata:
Vertical Federated Learning for Higher-Order Factorization Machines. PAKDD (2) 2021: 346-357 - 2020
- [c19]Hirofumi Suzuki
Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams. WALCOM 2020: 273-285
2010 – 2019
- 2019
- [c18]Masakazu Ishihata, Takanori Maehara:
Exact Bernoulli Scan Statistics using Binary Decision Diagrams. IJCAI 2019: 5737-5743 - [i6]Kentaro Kanamori, Satoshi Hara, Masakazu Ishihata, Hiroki Arimura:
Enumeration of Distinct Support Vectors for Interactive Decision Making. CoRR abs/1906.01876 (2019) - 2018
- [c17]Shinsaku Sakaue, Masakazu Ishihata:
Accelerated Best-First Search With Upper-Bound Computation for Submodular Function Maximization. AAAI 2018: 1413-1421 - [c16]Satoshi Hara, Masakazu Ishihata:
Approximate and Exact Enumeration of Rule Models. AAAI 2018: 3157-3164 - [c15]Shinsaku Sakaue, Masakazu Ishihata, Shin-ichi Minato:
Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams. AISTATS 2018: 585-594 - [c14]Hirofumi Suzuki
Exact Computation of Strongly Connected Reliability by Binary Decision Diagrams. COCOA 2018: 281-295 - [i5]Masakazu Ishihata, Takanori Maehara, Tomas Rigaux:
Algorithmic Meta-Theorems for Monotone Submodular Maximization. CoRR abs/1807.04575 (2018) - 2017
- [c13]Masakazu Ishihata, Shan Gao, Shin-ichi Minato:
Fast Message Passing Algorithm Using ZDD-Based Local Structure Compilation. AMBN 2017: 117-128 - [c12]Junpei Komiyama, Masakazu Ishihata, Hiroki Arimura, Takashi Nishibayashi, Shin-ichi Minato:
Statistical Emerging Pattern Mining with Multiple Testing Correction. KDD 2017: 897-906 - [c11]Takanori Maehara, Hirofumi Suzuki
Exact Computation of Influence Spread by Binary Decision Diagrams. WWW 2017: 947-956 - [i4]Takanori Maehara, Hirofumi Suzuki, Masakazu Ishihata:
Exact Computation of Influence Spread by Binary Decision Diagrams. CoRR abs/1701.01540 (2017) - [i3]Shinsaku Sakaue, Masakazu Ishihata, Shin-ichi Minato:
Practical Adversarial Combinatorial Bandit Algorithm via Compression of Decision Sets. CoRR abs/1707.08300 (2017) - 2016
- [c10]Mathieu Blondel, Masakazu Ishihata, Akinori Fujino, Naonori Ueda:
Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms. ICML 2016: 850-858 - [c9]Mathieu Blondel, Akinori Fujino, Naonori Ueda, Masakazu Ishihata:
Higher-Order Factorization Machines. NIPS 2016: 3351-3359 - [i2]Mathieu Blondel, Akinori Fujino, Naonori Ueda, Masakazu Ishihata:
Higher-Order Factorization Machines. CoRR abs/1607.07195 (2016) - [i1]Mathieu Blondel, Masakazu Ishihata, Akinori Fujino, Naonori Ueda:
Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms. CoRR abs/1607.08810 (2016) - 2014
- [c8]Masakazu Ishihata, Tomoharu Iwata:
Generating structure of latent variable models for nested data. UAI 2014: 350-359 - 2011
- [j1]Taisuke Sato
Constraint-based probabilistic modeling for statistical abduction. Mach. Learn. 83(2): 241-264 (2011) - [c7]Masakazu Ishihata, Taisuke Sato, Shin-ichi Minato:
Compiling Bayesian Networks for Parameter Learning Based on Shared BDDs. Australasian Conference on Artificial Intelligence 2011: 203-212 - [c6]Gabriel Synnaeve, Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima, Yoshitaka Kameya, Masakazu Ishihata, Taisuke Sato:
Kinetic Models and Qualitative Abstraction for Relational Learning in Systems Biology. BIOINFORMATICS 2011: 47-54 - [c5]Gabriel Synnaeve, Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima, Yoshitaka Kameya, Masakazu Ishihata, Taisuke Sato:
Discretized Kinetic Models for Abductive Reasoning in Systems Biology. BIOSTEC (Selected Papers) 2011: 141-154 - [c4]Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato
Variational Bayes Inference for Logic-Based Probabilistic Models on BDDs. ILP 2011: 189-203 - [c3]Masakazu Ishihata, Taisuke Sato:
Bayesian inference for statistical abduction using Markov chain Monte Carlo. ACML 2011: 81-96 - 2010
- [c2]Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato, Shin-ichi Minato:
An EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models. ACML 2010: 161-176
2000 – 2009
- 2009
- [c1]Katsumi Inoue, Taisuke Sato, Masakazu Ishihata, Yoshitaka Kameya, Hidetomo Nabeshima:
Evaluating Abductive Hypotheses using an EM Algorithm on BDDs. IJCAI 2009: 810-815
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-11-19 20:47 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: