Results 41 to 50 of about 2,610,566 (306)

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, Timothy H. McNicholl, Jason Rute   +2 more
openaire   +3 more sources

Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in ℓp Norm

, 2021
In this work, we give provable sieving algorithms for the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP) on lattices in ℓp norm (1≤p≤∞). The running time we obtain is better than existing provable sieving algorithms.
Priyanka Mukhopadhyay
core   +1 more source

Which Local Search Operator Works Best for the Open-Loop TSP?

Applied Sciences, 2019
The traveling salesman problem (TSP) has been widely studied for the classical closed-loop variant. However, very little attention has been paid to the open-loop variant.
Lahari Sengupta, Radu Mariescu-Istodor, Pasi Fränti   +2 more
doaj   +1 more source

Randomized Average Kaczmarz Algorithm for Tensor Linear Systems

Mathematics, 2022
For solving tensor linear systems under the tensor–tensor t-product, we propose the randomized average Kaczmarz (TRAK) algorithm, the randomized average Kaczmarz algorithm with random sampling (TRAKS), and their Fourier version, which can be effectively ...
Wendi Bao, Feiyu Zhang, Weiguo Li, Qin Wang, Ying Gao   +4 more
doaj   +1 more source

The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks

International Journal of Applied Mathematics and Computer Science, 2012
It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them.
Formanowicz Piotr, Tanaś Krzysztof
doaj   +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, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson   +4 more
openaire   +1 more source

Regularization Total Least Squares and Randomized Algorithms

Mathematics
In order to achieve an effective approximation solution for solving discrete ill-conditioned problems, Golub, Hansen, and O’Leary used Tikhonov regularization and the total least squares (TRTLS) method, where the bidiagonal technique is considered to ...
Zhanshan Yang, Xilan Liu, Tiexiang Li
doaj   +1 more source

Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth [PDF]

, 2003
In this paper we present two novel generic schemes for approximation algorithms for optimization to partial k-trees. Our first scheme yields deterministic polynomialtime algorithms achieving typically an approximation factor of k/ log n, where k
Chlebikova, Janka, Lingas, Andrzej,, Artur Czumaj, Johan Nilsson, Czumaj, Artur, Andrzej Lingas, Czumaj, A, Nilsson, J, Nilsson, Johan, Miroslav Chlebík, Chlebik, Miroslav, Miroslav Chlebik (4461319), Lingas, Andrzej, Janka Chlebíková, Janka Chlebíková (16060964)   +14 more
core   +1 more source

Randomized Algorithms for Scientific Computing (RASC) [PDF]

, 2023
Randomized algorithms have propelled advances in artificial intelligence and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion ...
Degennaro, Anthony, Restrepo, Juan, Nelson, Jelani, Wohlberg, Brendt, Kolda, Tamara G, Zwart, Peter, Wild, Stefan M, Restrepo, Juan M, Wright, Stephen, Buluc, Aydin, Yang, Chao, Lopes, Miles E, Kamath, Chandrika, Vrabie, Draguna, Seshadri, C, Wright, Stephen J, Lopes, Miles, Myers, Kary, Martinsson, Per-Gunnar, Seshadhri, C, Kolda, Tamara, Jakeman, John, Kannan, Ramakrishnan, Anitescu, Mihai, Wild, Stefan   +24 more
core   +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   +3 more sources