In this paper, two modifications of the clique problem are addressed: the Maximum Clique Problem and the k-Clique Problem, respectively. Simple randomized algorithm whose variants are able to solve both of the above problems is provided. The essential part of this paper contains a probabilistic ...
摘要: Proposes randomized construction techniques under an extended model for the design of ABFT systems with required fault tolerance capability. What the model considers; How the reliability of compute-intensive applications can be improved; Information on the analysis of fault detectability....
A RANDOMIZED ALGORITHM FOR PRINCIPAL COMPONENT ANALYSIS. Principal component analysis (PCA) requires the computation of a low-rank approximation to a matrix containing the data being analyzed. In many application... Rokhlin,Vladimir,Szlam,... - 《Siam Journal on Matrix Analysis & Applications》 被...
scheduling to minimize total weighted completion time are concerned.It's proved that the serial-batching scheduling is NP hard when the number of batches is fixed.For each of the two problems,mathematical programming is used to propose a randomized algorithm with worst case performance analysis,...
We introduce a novel and rather intuitive analysis of the algorithm in [ 6 ], which allows us to derive sharp estimates and give new insights about its performance. This analysis yields theoretical guarantees about the approximation error and at the same time, ultimate limits of performance (...
This contribution significantly improves the existing results by reducing the number of required samples in the randomized algorithm. These results are then applied to the analysis of worst-case performance and design with robust optimization. The second contribution of the paper is to introduce a ...
内容简介 Formanyapplications,arandomizedalgorithmiseitherthesimplestorthefastestalgorithmavailable,andsometimesboth.Thisbookintroducesthebasicconceptsinthedesignandanalysisofrandomizedalgorithms.Thefirstpartofthetextpresentsb其他版本 高等教育出版社 2008-10 ￥95.00起 — END —...
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. The first part of the text presents basic tools such as probability theory and pr...
June 2011 V. Rokhlin, A. Szlam, and M. Tygert, A randomized algorithm for principal component analysis, SIAM J. Matrix Anal. Appl., 31 (2009), pp. 1100–1124. Paul G. Constantine,David F. Gleich.Tall and skinny QR factorizations inMapReducearchitectures.ACM,June 08 - 08, 2011,pp....
Random Vector Functional-link (RVFL) networks, a class of learner models, can be regarded as feed-forward neural networks built with a specific randomized algorithm, i.e., the input weights and biases are randomly assigned and fixed during the training phase, and the output weights are analytic...