scientific article; zbMATH DE number 7378358

DOI10.4230/LIPIcs.MFCS.2018.41MaRDI QIDQ5005143

No author found.

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1511.01699

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

binary matricesapproximation algorithmslow rank approximation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Rang revealing QR factorizations
• Column subset selection via sparse approximation of SVD
• Covering graphs with few complete bipartite subgraphs
• Rank and null space calculations using matrix decomposition without column interchanges
• Generalized \(p\)-center problems: Complexity results and approximation algorithms
• On the existence and computation of rank-revealing LU factorizations
• Numerical methods for solving linear least squares problems
• Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
• Generalized Independent Component Analysis Over Finite Alphabets
• Randomized Algorithms for Matrices and Data
• Inapproximability of Maximum Weighted Edge Biclique and Its Applications
• Matrix approximation and projective clustering via volume sampling
• Adaptive Sampling and Fast Low-Rank Matrix Approximation
• On the Hardness of Decoding the Gale–Berlekamp Code
• Relative-Error $CUR$ Matrix Decompositions
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• Computing rank-revealing QR factorizations of dense matrices
• On Rank-Revealing Factorisations
• Low‐rank revealing QR factorizations
• A Clustering Approach to Constrained Binary Matrix Factorization
• Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• On the Complexity of Robust PCA and ℓ₁-Norm Low-Rank Matrix Approximation
• Independent Component Analysis Over Galois Fields of Prime Order
• Fast monte-carlo algorithms for finding low-rank approximations
• Near-Optimal Column-Based Matrix Reconstruction