Results 21 to 30 of about 10,207,361 (300)
A Randomized Algorithm for Approximating the Log Determinant of a Symmetric Positive Definite Matrix [PDF]
arXiv.org, 2015 We introduce a novel algorithm for approximating the logarithm of the determinant of a symmetric positive definite (SPD) matrix. The algorithm is randomized and approximates the traces of a small number of matrix powers of a specially constructed matrix,
Christos Boutsidis +3 more
semanticscholar +1 more source
IEEE Transactions on Information Theory, 2006 Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join and old nodes leave the network.
Stephen P. Boyd +3 more
semanticscholar +2 more sources
Sublinear Time Motif Discovery from Multiple Sequences
Algorithms, 2013 In this paper, a natural probabilistic model for motif discovery has been used to experimentally test the quality of motif discovery programs. In this model, there are k background sequences, and each character in a background sequence is a random ...
Yunhui Fu, Bin Fu, Yuan Xue
doaj +1 more source
A Randomized Distributed Kaczmarz Algorithm and Anomaly Detection
Axioms, 2022 The Kaczmarz algorithm is an iterative method for solving systems of linear equations. We introduce a randomized Kaczmarz algorithm for solving systems of linear equations in a distributed environment, i.e., the equations within the system are ...
Fritz Keinert, Eric S. Weber
doaj +1 more source
Randomized Parameterized Algorithms for the Kidney Exchange Problem
Algorithms, 2019 In order to increase the potential kidney transplants between patients and their incompatible donors, kidney exchange programs have been created in many countries.
Mugang Lin +3 more
doaj +1 more source
Probabilistic Algorithmic Randomness
The Journal of Symbolic Logic, 2013 AbstractWe introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness.
Sam Buss, Mia Minnes
openaire +2 more sources
Randomized priority algorithms
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelopoulos, Spyros, Borodin, Allan
openaire +4 more sources
Energy-Based Adaptive CUR Matrix Decomposition
IEEE 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
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 +4 more
doaj +1 more source
Proofs of randomized algorithms in Coq [PDF]
Science of Computer Programming, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Audebaud, Philippe +1 more
openaire +3 more sources