Results 31 to 40 of about 5,408,588 (346)
, 2022 Why not have a computer just draw a map? This is something you hear a lot when people talk about gerrymandering, and it's easy to think at first that this could solve redistricting altogether. But there are more than a couple problems with this idea. In this chapter, two computer scientists survey what's been done in algorithmic redistricting, discuss ...
Becker, Amariah, Solomon, Justin
openaire +2 more sources
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 ...
Vogl, TM +3 more
openaire +2 more sources
Quantum Algorithms Revisited [PDF]
, 1997 Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations.
Cleve, Richard +3 more
core +5 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
Improved Distributed Algorithms for Exact Shortest Paths
, 2018 Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et ...
A +3 more
core +1 more source
Tiled QR factorization algorithms [PDF]
, 2011 This work revisits existing algorithms for the QR factorization of rectangular matrices composed of p-by-q tiles, where p >= q. Within this framework, we study the critical paths and performance of algorithms such as Sameh and Kuck, Modi and Clarke ...
Bouwmeester, Henricus +3 more
core +5 more sources
Algorithms and Bounds for Very Strong Rainbow Coloring
, 2018 A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors.
Algorithms and Complexity +8 more
core +1 more source
Algorithms, Automation, and News [PDF]
This special issue examines the growing importance of algorithms and automation in the gathering, composition, and distribution of news. It connects a long line of research on journalism and computation with scholarly and professional terrain yet to be ...
Anderson C. W. +8 more
core +1 more source
ADataViewer: exploring semantically harmonized Alzheimer’s disease cohort datasets
Alzheimer’s Research & Therapy, 2022 Background Currently, Alzheimer’s disease (AD) cohort datasets are difficult to find and lack across-cohort interoperability, and the actual content of publicly available datasets often only becomes clear to third-party researchers once data access has ...
Yasamin Salimi +5 more
doaj +1 more source
Algorithms for Game Metrics [PDF]
, 2010 Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in
D.A. Martin +15 more
core +5 more sources