Pages that link to "Item:Q3546324"
From MaRDI portal
The following pages link to Fast computation of low-rank matrix approximations (Q3546324):
Displayed 41 items.
- Dimension reduction and construction of feature space for image pattern recognition (Q294416) (← links)
- Descriptive matrix factorization for sustainability. Adopting the principle of opposites (Q408702) (← links)
- Convergence analysis of iterated best response for a trusted computation game (Q518294) (← links)
- User-friendly tail bounds for sums of random matrices (Q695625) (← links)
- A novel coupling of noise reduction algorithms for particle flow simulations (Q726922) (← links)
- Randomized interpolative decomposition of separated representations (Q728743) (← links)
- Territorial design optimization for business sales plan (Q1636794) (← links)
- Randomized LU decomposition (Q1690696) (← links)
- Exemplar-based low-rank matrix decomposition for data clustering (Q1711222) (← links)
- An improvement of the parameterized frequent directions algorithm (Q1741237) (← links)
- Reducing uncertainty of dynamic heterogeneous information networks: a fusing reconstructing approach (Q1741322) (← links)
- A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality (Q1944905) (← links)
- Second order accurate distributed eigenvector computation for extremely large matrices (Q1952103) (← links)
- Randomized LU decomposition using sparse projections (Q2012724) (← links)
- GraphLSHC: towards large scale spectral hypergraph clustering (Q2054077) (← links)
- Spectral estimation from simulations via sketching (Q2133499) (← links)
- Far-field compression for fast kernel summation methods in high dimensions (Q2397164) (← links)
- A note on linear function approximation using random projections (Q2519761) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- Quantum context-aware recommendation systems based on tensor singular value decomposition (Q2690264) (← links)
- A remark on the spectra of random graphs with given expected degrees (Q2832929) (← links)
- Low-Rank Matrix Approximations Do Not Need a Singular Value Gap (Q3119542) (← links)
- (Q4558476) (← links)
- Randomized algorithms in numerical linear algebra (Q4594242) (← links)
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. (Q4603696) (← links)
- Clustering subgaussian mixtures by semidefinite programming (Q4603713) (← links)
- Literature survey on low rank approximation of matrices (Q4603753) (← links)
- (Q4633059) (← links)
- Recovering PCA from Hybrid-$(\ell_1,\ell_2)$ Sparse Sampling of Data Elements (Q4636984) (← links)
- Analyzing Multiple‐Probe Microarray: Estimation and Application of Gene Expression Indexes (Q4649055) (← links)
- Weighted community detection and data clustering using message passing (Q4964522) (← links)
- Non‐negative residual matrix factorization: problem definition, fast solutions, and applications (Q4969817) (← links)
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models (Q5057098) (← links)
- (Q5125449) (← links)
- Subsampling Algorithms for Semidefinite Programming (Q5168846) (← links)
- Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA (Q5214234) (← links)
- Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition (Q5865522) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- Comparison of matrix norm sparsification (Q6066776) (← links)
- Detection thresholds in very sparse matrix completion (Q6072328) (← links)
- Quantum-inspired canonical correlation analysis for exponentially large dimensional data (Q6078670) (← links)