activity
20212026
most citedSolving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions

2 citations · 3 across the 8 of their papers we have counts for

collaborators

8 papers

cs.AI2026

Variance Computation for Weighted Model Counting with Knowledge Compilation Approach

Kengo Nakamura, Masaaki Nishino, Norihito Yasuda

One of the most important queries in knowledge compilation is weighted model counting (WMC), which has been applied to probabilistic inference on various models, such as Bayesian n…

cs.CL2025

JaParaPat: A Large-Scale Japanese-English Parallel Patent Application Corpus

Masaaki Nagata, Katsuki Chousa, Norihito Yasuda

We constructed JaParaPat (Japanese-English Parallel Patent Application Corpus), a bilingual corpus of more than 300 million Japanese-English sentence pairs from patent applications…

cs.DS2025

Tensor Decomposition Meets Knowledge Compilation: A Study Comparing Tensor Trains with OBDDs

Ryoma Onaka, Kengo Nakamura, Masaaki Nishino +1

A knowledge compilation map analyzes tractable operations in Boolean function representations and compares their succinctness. This enables the selection of appropriate representat…

cs.CL2024

A Japanese-Chinese Parallel Corpus Using Crowdsourcing for Web Mining

Masaaki Nagata, Makoto Morishita, Katsuki Chousa +1

Using crowdsourcing, we collected more than 10,000 URL pairs (parallel top page pairs) of bilingual websites that contain parallel documents and created a Japanese-Chinese parallel…

cs.IT2023

Optimal Construction of N-bit-delay Almost Instantaneous Fixed-to-Variable-Length Codes

Ryosuke Sugiura, Masaaki Nishino, Norihito Yasuda +2

This paper presents an optimal construction of -bit-delay almost instantaneous fixed-to-variable-length (AIFV) codes, the general form of binary codes we can make when finite bi…

cs.DS2023★ 1 cited

International Competition on Graph Counting Algorithms 2023

Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima +3

This paper reports on the details of the International Competition on Graph Counting Algorithms (ICGCA) held in 2023. The graph counting problem is to count the subgraphs satisfyin…

cs.LG2022

Generalization Analysis on Learning with a Concurrent Verifier

Masaaki Nishino, Kengo Nakamura, Norihito Yasuda

Machine learning technologies have been used in a wide range of practical systems. In practical situations, it is natural to expect the input-output pairs of a machine learning mod…

cs.DM2021★ 2 cited

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions

Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama +7

A rep-tile is a polygon that can be dissected into smaller copies (of the same size) of the original polygon. A polyomino is a polygon that is formed by joining one or more unit sq…