Results 31 to 40 of about 10,207,361 (300)
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS [PDF]
The 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]
Theory 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
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting [PDF]
SIAM Journal on Numerical Analysis, 2011 We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to the algorithm for discrepancy approximation of Winker and Fang [SIAM J. Numer. Anal., 34 (1997), pp.
M. Gnewuch +2 more
semanticscholar +1 more source
Probabilistic Algorithmic Knowledge [PDF]
Logical Methods in Computer Science, 2005 The framework of algorithmic knowledge assumes that agents use deterministic knowledge algorithms to compute the facts they explicitly know. We extend the framework to allow for randomized knowledge algorithms.
Joseph Y. Halpern, Riccardo Pucella
doaj +1 more source
Notes on Randomized Algorithms
CoRR, 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 +2 more sources
Journal 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
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin +2 more
wiley +1 more source
On the power of randomization in on-line algorithms [PDF]
Algorithmica, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shai Ben-David +4 more
openaire +1 more source
Massive Fishing Website URL Parallel Filtering Method
IEEE Access, 2018 A randomized fingerprint model is proposed, which can effectively reduce the false positive rate by generating a unique fingerprint for each URL. The model is also used to improve the Wu and Manber (WM) algorithm, which is a multi-string matching ...
Dongliang Xu +5 more
doaj +1 more source
A Randomized Algorithm for Principal Component Analysis [PDF]
SIAM Journal on Matrix Analysis and Applications, 2008 Principal component analysis (PCA) requires the computation of a low-rank approximation to a matrix containing the data being analyzed. In many applications of PCA, the best possible accuracy of any rank-deficient approximation is at most a few digits ...
V. Rokhlin, Arthur Szlam, M. Tygert
semanticscholar +1 more source