Results 21 to 30 of about 372,561 (297)
Statistical Methods in Computer Science: A Comparative Review of Inductive and Deductive Approaches
VAWKUM Transactions on Computer Sciences, 2023 Combination issues lie at the core of computer science and modern discrete mathematics. Artificial intelligence lays the foundation for induction and deduction techniques.
Sidra Niaz +3 more
semanticscholar +1 more source
On the Study of the n-dimensional Boolean Cube in the Undergraduate Programs in Computer Science [PDF]
International Conference on Applied Informatics, 2021 We present our arguments for a more in-depth study of the Boolean cube, which is one of the most important discrete structures. The article is based on a case study that analyses how the Boolean cube has been included and explained in more than 80 ...
V. Bakoev
semanticscholar +1 more source
Bringing a CURE into a Discrete Mathematics Course and Beyond
The Mathematics Enthusiast, 2022 Course-based Undergraduate Research Experiences (CUREs) have been well developed in the hard sciences, but math CUREs are all but absent from the literature.
Lipika Deka +2 more
semanticscholar +1 more source
The Impact of Covid-19 on Online Final Exam Scores Among Computer Science Students
European Conference on Knowledge Management, 2022 The main goal of this research is to identify the impact of COVID-19 on online final exam scores among Computer Science students. The correlation matrix we used indicates the interrelationships among learning outcomes and student profile, type of classes,
Joanna Wójcik, Małgorzata Rataj
semanticscholar +1 more source
On the critical exponent of generalized Thue-Morse words [PDF]
, 2007 For certain generalized Thue-Morse words t, we compute the "critical exponent", i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine exactly the occurrences of powers realizing it.Comment: 13 pages; to appear
Blondin-Massé, Alexandre +3 more
core +5 more sources
Flows on Simplicial Complexes [PDF]
, 2012 Given a graph $G$, the number of nowhere-zero $\ZZ_q$-flows $\phi_G(q)$ is known to be a polynomial in $q$. We extend the definition of nowhere-zero $\ZZ_q$-flows to simplicial complexes $\Delta$ of dimension greater than one, and prove the polynomiality
Beck, Matthias, Kemper, Yvonne
core +5 more sources
On the existence of block-transitive combinatorial designs [PDF]
, 2010 Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and ...
Huber, Michael
core +4 more sources
Counting descents, rises, and levels, with prescribed first element, in words [PDF]
, 2006 Recently, Kitaev and Remmel [Classifying descents according to parity, Annals of Combinatorics, to appear 2007] refined the well-known permutation statistic ``descent'' by fixing parity of one of the descent's numbers. Results in that paper were extended
Kitaev, Sergey +2 more
core +12 more sources
Discrete Mathematics into K-11 and K-12 Grade Education
Journal of University of Shanghai for Science and Technology, 2021 Discrete mathematics is one of the significant part of K-11 and K-12 grade college classrooms. In this contribution, we discuss the usefulness of basic elementary, some of the intermediate discrete mathematics for K-11 and K-12 grade colleges.
Mr. Balaji. N, Dr. Karthik Pai B H
semanticscholar +1 more source