Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Jessalyn Bolkema"'
Autor:
Jürgen Kritschgau, Daniel Kaiser, Oliver Alvarado Rodriguez, Ilya Amburg, Jessalyn Bolkema, Thomas Grubb, Fangfei Lan, Sepideh Maleki, Phil Chodrow, Bill Kay
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-18 (2024)
Abstract The hypergraph community detection problem seeks to identify groups of related vertices in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community
Externí odkaz:
https://doaj.org/article/a8173faced5143a1b67c8e4983dad8a7
Autor:
Gretchen L. Matthews, Jessalyn Bolkema, Kathryn Haymaker, Katherine F. Benson, Esmeralda Nastase, S. R. Kingan, Christine A. Kelley
Publikováno v:
Association for Women in Mathematics Series ISBN: 9783030779825
Termatiko sets are combinatorial structures that have been shown to hinder the success of the Interval-Passing Algorithm in compressed sensing. In this paper, we show how termatiko sets relate to other combinatorial structures in graphs representing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::192b4f6e048d52dd93f41e490879179b
https://doi.org/10.1007/978-3-030-77983-2_3
https://doi.org/10.1007/978-3-030-77983-2_3
Publikováno v:
International Journal of Research in Undergraduate Mathematics Education. 4:376-392
The purpose of this study was to investigate implementation of an early intervention mastery activity during the first two weeks of college algebra and precalculus courses at a large U.S. public university. Statistical modeling of (N = 935) students
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2f055ee5d7be8ea83cc888c8e461e5d
https://doi.org/10.1007/s40753-018-0075-8
https://doi.org/10.1007/s40753-018-0075-8
Autor:
Kristin E. Lauter, Heide Gluesing-Luerssen, Beth Malmskog, Jessalyn Bolkema, Christine A. Kelley, Joachim Rosenthal
Publikováno v:
Association for Women in Mathematics Series ISBN: 9783319639307
Two variations of the McEliece cryptosystem are presented. The first one is based on a relaxation of the column permutation in the classical McEliece scrambling process. This is done in such a way that the Hamming weight of the error, added in the en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::37dd20650c737f958212d164d132b09d
https://www.zora.uzh.ch/id/eprint/148594/
https://www.zora.uzh.ch/id/eprint/148594/