Results 31 to 40 of about 4,174,426 (295)

On Algorithmic Statistics for Space-Bounded Algorithms [PDF]

open access: yesTheory of Computing Systems, 2017
accepted to CSR 2017 ...
openaire   +3 more sources

Algorithms with Predictions

open access: yesCommunications of the ACM, 2020
Seeking a new approach that goes beyond worst-case analysis.
Michael Mitzenmacher   +1 more
openaire   +2 more sources

Adaptive Alternating Minimization Algorithms [PDF]

open access: yes, 2008
The classical alternating minimization (or projection) algorithm has been successful in the context of solving optimization problems over two variables. The iterative nature and simplicity of the algorithm has led to its application to many areas such as
Niesen, Urs   +2 more
core   +3 more sources

Heating the Solar Atmosphere by the Self-Enhanced Thermal Waves Caused by the Dynamo Processes

open access: yes, 2012
We discuss a possible mechanism for heating the solar atmosphere by the ensemble of thermal waves, generated by the photospheric dynamo and propagating upwards with increasing magnitudes.
Aschwanden   +3 more
core   +1 more source

Characterisations of Ideal Threshold Schemes [PDF]

open access: yesDiscrete 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

Improved Distributed Algorithms for Exact Shortest Paths

open access: yes, 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

Algorithmic polynomials [PDF]

open access: yesProceedings 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

Algorithmic Bureaucracy [PDF]

open access: yesProceedings 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

On Cheating Immune Secret Sharing [PDF]

open access: yesDiscrete 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

Algorithms, Automation, and News [PDF]

open access: yes
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

Home - About - Disclaimer - Privacy