Zobrazeno 1 - 10
of 71
pro vyhledávání: '"zero-suppressed binary decision diagram"'
Publikováno v:
IEEE Access, Vol 12, Pp 91886-91895 (2024)
The zero-suppressed binary decision diagram (ZDD) is a compact data structure widely used for the efficient representation of families of sparse subsets. Its inherent recursive structure also facilitates easy diagram manipulation and family operation
Externí odkaz:
https://doaj.org/article/28706bdc4a834fd6a4656852f3a1d0f8
Publikováno v:
Statistics and Public Policy, Vol 7, Iss 1, Pp 52-68 (2020)
As granular data about elections and voters become available, redistricting simulation methods are playing an increasingly important role when legislatures adopt redistricting plans and courts determine their legality. These simulation methods are de
Externí odkaz:
https://doaj.org/article/69551dcd9e50435ca3bfb262d1a22240
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The subgraph counting problem computes the number of subgraphs of a given graph that satisfy some constraints. Among various constraints imposed on a graph, those regarding the connectivity of vertices, such as "these two vertices must be connected,"
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ffa798ab32df62699be7b80130cafb7
Publikováno v:
Statistics and Public Policy, Vol 7, Iss 1, Pp 52-68 (2020)
As granular data about elections and voters become available, redistricting simulation methods are playing an increasingly important role when legislatures adopt redistricting plans and courts determine their legality. These simulation methods are de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::baa575f0dceb9e1343c627ec176bfd58
https://doi.org/10.1080/2330443x.2020.1791773
https://doi.org/10.1080/2330443x.2020.1791773
Autor:
Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
Publikováno v:
Algorithms, Vol 11, Iss 8, p 128 (2018)
In this article, we propose a succinct data structure of zero-suppressed binary decision diagrams (ZDDs). A ZDD represents sets of combinations efficiently and we can perform various set operations on the ZDD without explicitly extracting combination
Externí odkaz:
https://doaj.org/article/9c705700e01a469b968c23582c8c2e8e
Autor:
Nakahata, Yu
甲第23548号
情博第778号
新制||情||132(附属図書館)
学位規則第4条第1項該当
Doctor of Informatics
Kyoto University
DFAM
情博第778号
新制||情||132(附属図書館)
学位規則第4条第1項該当
Doctor of Informatics
Kyoto University
DFAM
Externí odkaz:
http://hdl.handle.net/2433/266076