Results 41 to 50 of about 5,265,833 (340)
Adaptive Alternating Minimization Algorithms [PDF]
, 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
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
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
Heating the Solar Atmosphere by the Self-Enhanced Thermal Waves Caused by the Dynamo Processes
, 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
Unconfused Ultraconservative Multiclass Algorithms [PDF]
, 2013 We tackle the problem of learning linear classifiers from noisy datasets in a multiclass setting. The two-class version of this problem was studied a few years ago by, e.g. Bylander (1994) and Blum et al.
Louche, Ugo, Ralaivola, Liva
core +5 more sources
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
Optimal Distributed Covering Algorithms [PDF]
, 2019 We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank f. This problem is equivalent to the Minimum Weight Set Cover problem in which the frequency of every element is bounded ...
Ben-Basat, Ran +3 more
core +2 more sources
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
Nondeterministic Algorithms [PDF]
Journal of the ACM, 1967 Programs to solve combinatorial search problems may often be simply written by using multiple-valued functions. Such programs, although impossible to execute directly on conventional computers, may be converted in a mechanical way into conventional backtracking programs.
openaire +1 more source
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