In this paper, we present a new method to analyze unordered n-grams by using ZBDDs (Zero-suppressed BDDs). n-grams have been used not only for text analysis but also for text indexing in some search engines. We newly use a variation of n-grams called unordered n-grams. Unordered n-grams abstract from the position of the characters in each n-gram, i.e., they just deal with the range of ordinary ...

The representations of assembly knowledge and assembly sequences are crucial in assembly planning, where the size of parts involved is a significant and often prohibitive difficulty. Zero-suppressed binary decision diagram (ZBDD) is an efficient form to represent and manipulate the sets of combination, and appears to give improved results for large-scale combinatorial optimization problems. In ...

Set sharing is an abstract domain in which each concrete object is represented by the set of local variables from which it might be reachable. It is a useful abstraction to detect parallelism opportunities, since it contains definite information about which variables do not share in memory, i.e., about when the memory regions reachable from those variables are disjoint. Set sharing is a more pr...

Constrained encoding has several applications in the synthesis of finite state machines (FSMs). E.g., it can be used to generate asynchronous FSM state assignment that guarantees a critical hazard-free implementation, or to generate synchronous FSM state assignment with minimum PLA implementation. This paper presents ZEDICHO, an original zero-suppressed binary decision diagram (ZBDD) based algo...

Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi-linear functions (MLFs) based on Zero-suppressed BDDs (ZBDDs), which are the graph-based representation of combinatorial item sets. Our method is different from the original approach of Darwiche et. al which encodes B...

We consider the adversarial combinatorial multi-armed bandit (CMAB) problem, whose decisionset can be exponentially large with respect to the number of given arms. To avoid dealing with suchlarge decision sets directly, we propose an algorithm performed on a zero-suppressed binary decisiondiagram (ZDD), which is a compressed representation of the decision set. The proposed algor...