Results 21 to 30 of about 4,184,946 (299)

On the randomized Kaczmarz algorithm for phase retrieval.

open access: yes, 2022
We investigate a variant of the randomized Kaczmarz algorithm as a method for solving the phase retrieval problem. The main contribution of this paper is a recovery guarantee for phase retrieval from measurements perturbed with additive noise via the ...
Krahmer, F., Filbir, F.
core   +1 more source

A randomized CPA-secure asymmetric-key chaotic color image encryption scheme based on the Chebyshev mappings and one-time pad

open access: yesJournal of King Saud University: Computer and Information Sciences, 2021
Highlights: • A novel chaotic asymmetric-key color image encryption algorithm is proposed. • The multiplicative coupled Chebyshev-based encryption scheme allows arbitrary sizes of keyspace.
Ali Shakiba
doaj   +1 more source

Randomized priority algorithms

open access: yesTheoretical Computer Science, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelopoulos, Spyros, Borodin, Allan
openaire   +5 more sources

On the Randomized Kaczmarz Algorithm [PDF]

open access: yesIEEE Signal Processing Letters, 2014
The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related to the question raised by \cite{c2}. Illustrative experiments are conducted to support the findings.
Liang Dai 0002   +2 more
openaire   +4 more sources

Estimating the weight of metric minimum spanning trees in sublinear time [PDF]

open access: yes, 2008
In this paper we present a sublinear-time $(1+\varepsilon)$-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an $n$-point metric space. The running time of the algorithm is $\widetilde{\mathcal{O}}(n/\varepsilon^{\
Christian Sohler   +3 more
core   +1 more source

Proofs of randomized algorithms in Coq [PDF]

open access: yesScience of Computer Programming, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Audebaud, Philippe   +1 more
openaire   +4 more sources

COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS [PDF]

open access: yesThe Journal of Symbolic Logic, 2016
AbstractA coarse description of a set A ⊆ ω is a set D ⊆ ω such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse descriptions of a given set A, especially when A is effectively random in some sense.
Denis R. Hirschfeldt   +3 more
openaire   +2 more sources

Algorithmic Randomness and Fourier Analysis [PDF]

open access: yesTheory of Computing Systems, 2018
Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-π, π]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f \in L^p[-π, π]$ given natural computability conditions on $f$ and $p$.
Johanna N. Y. Franklin   +2 more
openaire   +3 more sources

Energy-Based Adaptive CUR Matrix Decomposition

open access: yesIEEE Access, 2023
CUR decompositions are interpretable data analysis tools that express a data matrix in terms of a small number of actual columns and/or actual rows of the data matrix.
Liwen Xu, Xuejiao Zhao, Yongxia Zhang
doaj   +1 more source

Notes on Randomized Algorithms

open access: yesCoRR, 2020
Lecture notes for the Yale Computer Science course CPSC 4690/5690 Randomized Algorithms. Suitable for use as a supplementary text for an introductory graduate or advanced undergraduate course on randomized algorithms. Discusses tools from probability theory, including random variables and expectations, union bound arguments, concentration bounds ...
openaire   +3 more sources

Home - About - Disclaimer - Privacy