Boosting over non-deterministic ZDDs

DOI10.1007/978-3-319-75172-6_17MaRDI QIDQ5915642zbMATH OpenOpenAlexFDO

Authors Takahiro Fujita, Kohei Hatano, Eiji Takimoto

Publication date 15 June 2018

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2324/1932329

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Boosting over non-deterministic ZDDs
• DenseZDD: a compact and fast index for families of sets
• Storing set families more compactly with top ZDDs
• scientific article; zbMATH DE number 6999904
• Zero-suppression and computation models

Cited in

(2)

• Estimation of the Density of Datasets with Decision Diagrams
• Boosting over non-deterministic ZDDs

This page was built for publication: Boosting over non-deterministic ZDDs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915642)