Results 31 to 40 of about 1,009,089 (269)
On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$.
Nicolas Bédaride +3 more
doaj +1 more source
Constrained ear decompositions in graphs and digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a ...
Frédéric Havet, Nicolas Nisse
doaj +1 more source
Development of an early alert model for pandemic situations in Germany
Scientific Reports, 2023 The COVID-19 pandemic has pointed out the need for new technical approaches to increase the preparedness of healthcare systems. One important measure is to develop innovative early warning systems.
Danqi Wang +9 more
doaj +1 more source
On Algorithmic Statistics for Space-Bounded Algorithms [PDF]
Theory of Computing Systems, 2017 accepted to CSR 2017 ...
openaire +3 more sources
Communications of the ACM, 2020 Seeking a new approach that goes beyond worst-case analysis.
Michael Mitzenmacher +1 more
openaire +2 more sources
Characterisations of Ideal Threshold Schemes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 We characterise ideal threshold schemes from different approaches. Since the characteristic properties are independent to particular descriptions of threshold schemes all ideal threshold schemes can be examined by new points of view and new results on ...
Josef Pieprzyk, Xian-Mo Zhang
doaj +1 more source
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in learning theory, differential privacy, and algorithm design in general.
openaire +4 more sources
On Cheating Immune Secret Sharing [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 The paper addresses the cheating prevention in secret sharing. We consider secret sharing with binary shares. The secret also is binary. This model allows us to use results and constructions from the well developed theory of cryptographically strong ...
Josef Pieprzyk, Xian-Mo Zhang
doaj +1 more source
Proceedings of the 20th Annual International Conference on Digital Government Research, 2019 In recent years, local government has been undergoing changes which are strongly influenced by the growing digitization of governmental operations. In this paper, we expand on the concepts of Digital Era Governance and its successor, Essentially Digital Government, by introducing the concept of Algorithmic Bureaucracy, which looks at the impacts of ...
Thomas M. Vogl +3 more
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An earlier study on children diagnosed with acute lymphoblastic leukemia (ALL) at Moi Teaching and Referral Hospital (MTRH) in Kenya reported a low event‐free survival (EFS), excess treatment abandonment, and high induction mortality.
Gilbert Olbara +7 more
wiley +1 more source