Results 241 to 250 of about 10,207,361 (300)
Some of the next articles are maybe not open access.
A simple randomized algorithm for two-dimensional strip packing
Computers and Operations Research, 2013Shuihua Han
exaly +2 more sources
Fast randomized algorithm for center-detection
Pattern Recognition, 2010Kuo-Liang Chung +2 more
exaly +2 more sources
Computability, 2023
Rademacher (Mathematische Annalen 87 (1922) 112–138), Steinhaus (Mathematische Zeitschrift 31 (1930) 408–416) and Paley and Zygmund (Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 337–257, Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 458–474, Mathematical Proceedings of the Cambridge Philosophical
Rodney G. Downey +2 more
openaire +1 more source
Rademacher (Mathematische Annalen 87 (1922) 112–138), Steinhaus (Mathematische Zeitschrift 31 (1930) 408–416) and Paley and Zygmund (Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 337–257, Mathematical Proceedings of the Cambridge Philosophical Society 26 (1930) 458–474, Mathematical Proceedings of the Cambridge Philosophical
Rodney G. Downey +2 more
openaire +1 more source
On the Randomized Kaczmarz Algorithm [PDF]
IEEE 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.
Kristiaan Pelckmans +1 more
exaly +3 more sources
Theory of Probability & Its Applications, 1988
This paper is one of the last works of A. N. Kolmogorov who was the founder of many branches of probability theory. (Kolmogorov died on October 20, 1987.) He was one of the initiators of the algorithmic definition of randomness. His brilliant ideas influenced very deeply this area which had also profound implications for other fields of science from ...
Kolmogorov, A. N., Uspenskij, V. A.
openaire +3 more sources
This paper is one of the last works of A. N. Kolmogorov who was the founder of many branches of probability theory. (Kolmogorov died on October 20, 1987.) He was one of the initiators of the algorithmic definition of randomness. His brilliant ideas influenced very deeply this area which had also profound implications for other fields of science from ...
Kolmogorov, A. N., Uspenskij, V. A.
openaire +3 more sources
Communications of the ACM, 2019
Tracing some of the latest advancements in algorithmic randomness.
Rod Downey, Denis R. Hirschfeldt
openaire +1 more source
Tracing some of the latest advancements in algorithmic randomness.
Rod Downey, Denis R. Hirschfeldt
openaire +1 more source
Energy, 2018
Inspired by the interesting idea of randomization, some powerful but time-consuming decomposition-ensemble learning paradigms can be extended into extremely efficient and fast variants by using randomized algorithms as individual forecasting tools.
L. Tang, Yao Wu, Lean Yu
semanticscholar +1 more source
Inspired by the interesting idea of randomization, some powerful but time-consuming decomposition-ensemble learning paradigms can be extended into extremely efficient and fast variants by using randomized algorithms as individual forecasting tools.
L. Tang, Yao Wu, Lean Yu
semanticscholar +1 more source
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum
SIAM Symposium on Simplicity in Algorithms, 2018Given a multiset S of n positive integers and a target integer t, the Subset Sum problem asks to determine whether there exists a subset of S that sums up to t. The current best deterministic algorithm, by Koiliaris and Xu [SODA'17], runs in O~(sqrt{n}t)
Ce Jin, Hongxun Wu
semanticscholar +1 more source
On randomized Lanczos algorithms
Proceedings of the 1997 international symposium on Symbolic and algebraic computation - ISSAC '97, 1997Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algorithm that has been used for integer factorization, and to the (provably reliable) algorithm of Wiedemann.
Wayne Eberly, Erich L. Kaltofen
openaire +1 more source
A randomized algorithm for k-colorability
Discrete Mathematics, 1994 The author tests a straightforward generalization of \textit{A. D. Petford} and \textit{D. J. A. Welsh} [A randomized 3-colouring algorithm, Discrete Math. 74, No. 1/2, 253-261 (1989; Zbl 0667.05025)] on randomly generated samples of 4- and 10-colourable graphs, and he conjectures that the curious critical regions found in the case of 3-colourings are ...
Janez Žerovnik
exaly +2 more sources