3 citations · 3 across the 5 of their papers we have counts for
4 papers · 1 filter
Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs
Kengo Nakamura, Masaaki Nishino
Given a network and a set of vertices called seeds to initially inject information, influence spread is the expected number of vertices that eventually receive the information unde…
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…
Single Family Algebra Operation on BDDs and ZDDs Leads To Exponential Blow-Up
Kengo Nakamura, Masaaki Nishino, Shuhei Denzumi
Binary decision diagram (BDD) and zero-suppressed binary decision diagram (ZDD) are data structures to represent a family of (sub)sets compactly, and it can be used as succinct ind…
Variable Shift SDD: A More Succinct Sentential Decision Diagram
Kengo Nakamura, Shuhei Denzumi, Masaaki Nishino
The Sentential Decision Diagram (SDD) is a tractable representation of Boolean functions that subsumes the famous Ordered Binary Decision Diagram (OBDD) as a strict subset. SDDs ar…