Search Results - "pass-efficient algorithm"

Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation by Yu, Wenjian, Gu, Yu, Li, Yaohang

Get full text

Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions by Halko, N., Martinsson, P. G., Tropp, J. A.

“…Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data…”
Get full text

Randomized Algorithms for Low-Rank Matrix Factorizations: Sharp Performance Bounds by Witten, Rafi, Candès, Emmanuel

“…The development of randomized algorithms for numerical linear algebra, e.g. for computing approximate QR and SVD factorizations, has recently become an intense…”
Get full text

PASS-EFFICIENT ALGORITHMS FOR LEARNING MIXTURES OF UNIFORM DISTRIBUTIONS by CHANG, Kevin L, KANNAN, Ravi

Get full text

Pass-Efficient Algorithms for Learning Mixtures of Uniform Distributions by Chang, Kevin L., Kannan, Ravi

“…The authors present multiple pass streaming algorithms for a basic statistical clustering problem for massive data sets. If the algorithm is allotted 2…”
Get full text

A Randomized Algorithm for Tensor Singular Value Decomposition Using an Arbitrary Number of Passes by Ahmadi-Asl, Salman, Phan, Anh-Huy, Cichocki, Andrzej

“…Efficient and fast computation of a tensor singular value decomposition (t-SVD) with a few passes over the underlying data tensor is crucial because of its…”
Get full text

Pass -efficient algorithms for clustering by Chang, Kevin Li-Chiang

“… The resources to be optimized are memory, number of passes, and per element processing time. We give pass-efficient algorithms…”
Get full text

Managing waiting times of backordered demands in single-stage (Q, r) inventory systems by Boyacı, Tamer, Gallego, Guillermo

“… For logconcave discrete lead time demand distributions we find a single‐pass efficient algorithm based on a novel search stopping criterion…”
Get full text

Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation by Yu, Wenjian, Gu, Yu, Li, Yaohang

“…Randomized algorithms for low-rank matrix approximation are investigated, with the emphasis on the fixed-precision problem and computational efficiency for…”
Get full text

Efficient Algorithms and Data Structures for Massive Data Sets by Alka

“…For many algorithmic problems, traditional algorithms that optimise on the number of instructions executed prove expensive on I/Os. Novel and very different…”
Get full text