Results 11 to 20 of about 10,207,361 (300)
ACM Computing Surveys, 1995 For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms.
R. Motwani, P. Raghavan
semanticscholar +3 more sources
A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
SIAM Journal on Matrix Analysis and Applications, 2011 P G Martinsson
exaly +2 more sources
An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks
IEEE Transactions on Network Science and Engineering, 2020 Social networks allow rapid spread of ideas and innovations while negative information can also propagate widely. When a user receives two opposing opinions, they tend to believe the one arrives first. Therefore, once misinformation or rumor is detected,
G. Tong +6 more
semanticscholar +1 more source
Cryptography and Algorithmic Randomness [PDF]
Theory of Computing Systems, 2014 34 pages, LaTeX2e, no ...
Kohtaro Tadaki, Norihisa Doi
openaire +2 more sources
Robust Three-Microphone Speech Source Localization Using Randomized Singular Value Decomposition
IEEE Access, 2021 Direction-of-arrival (DOA) estimation is a fundamental technique in array signal processing due to its wide applications in beamforming, speech enhancement and many other assistive speech processing technologies.
Serkan Tokgoz, Issa M. S. Panahi
doaj +1 more source
Quantum algorithmic randomness [PDF]
Journal of Mathematical Physics, 2021 Quantum Martin-Löf randomness (q-MLR) for infinite qubit sequences was introduced by Nies and Scholz [J. Math. Phys. 60(9), 092201 (2019)]. We define a notion of quantum Solovay randomness, which is equivalent to q-MLR. The proof of this goes through a purely linear algebraic result about approximating density matrices by subspaces.
openaire +2 more sources
A randomized algorithm for long directed cycle [PDF]
Information Processing Letters, 2015 Given a directed graph $G$ and a parameter $k$, the {\sc Long Directed Cycle (LDC)} problem asks whether $G$ contains a simple cycle on at least $k$ vertices, while the {\sc $k$-Path} problems asks whether $G$ contains a simple path on exactly $k ...
M. Zehavi
semanticscholar +1 more source
IEEE Access, 2018 Determining the variable transmission structure is the key step in designing a distributed monitoring scheme for multiunit processes. This paper proposes randomized algorithm (RA) integrated with evolutionary optimization-based data-driven distributed ...
Qingchao Jiang, Yang Wang, Xuefeng Yan
doaj +1 more source
A coupon collector's problem with bonuses [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In this article, we study a variant of the coupon collector's problem introducing a notion of a \emphbonus. Suppose that there are c different types of coupons made up of bonus coupons and ordinary coupons, and that a collector gets every coupon with ...
Toshio Nakata, Izumi Kubo
doaj +1 more source
Randomized Matrix Decompositions Using R
Journal of Statistical Software, 2019 Matrix decompositions are fundamental tools in the area of applied mathematics, statistical computing, and machine learning. In particular, low-rank matrix decompositions are vital, and widely used for data analysis, dimensionality reduction, and data ...
N. Benjamin Erichson +3 more
doaj +1 more source