Pages that link to "Item:Q4603753"

The following pages link to Literature survey on low rank approximation of matrices (Q4603753):

Displaying 22 items.

• Main effects and interactions in mixed and incomplete data frames (Q146484) (← links)
• Randomized recompression of \(\mathcal {H}\)-matrices for BEM (Q1734172) (← links)
• An ensemble of high rank matrices arising from tournaments (Q2104983) (← links)
• CDPA: common and distinctive pattern analysis between high-dimensional datasets (Q2137801) (← links)
• Imputation and low-rank estimation with missing not at random data (Q2209726) (← links)
• Column subset selection is NP-complete (Q2228097) (← links)
• Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting (Q2231598) (← links)
• On the rank-one approximation of positive matrices using tropical optimization methods (Q2289366) (← links)
• Linear-time CUR approximation of BEM matrices (Q2292005) (← links)
• Bivariate Hermite interpolation by a limiting case of the cross approximation algorithm (Q2309247) (← links)
• A strengthened Barvinok-Pataki bound on SDP rank (Q2670438) (← links)
• CMD: controllable matrix decomposition with global optimization for deep neural network compression (Q2673311) (← links)
• Parallel cross interpolation for high-precision calculation of high-dimensional integrals (Q2698750) (← links)
• Sublinear Cost Low Rank Approximation via Subspace Sampling (Q5014667) (← links)
• Analytical Low-Rank Compression via Proxy Point Selection (Q5146610) (← links)
• Interpolative Decomposition via Proxy Points for Kernel Matrices (Q5217103) (← links)
• A Multiscale Neural Network Based on Hierarchical Matrices (Q5222107) (← links)
• Best Low-rank Approximations and Kolmogorov $n$-widths (Q5857847) (← links)
• Seq-SVF: an unsupervised data-driven method for automatically identifying hidden governing equations (Q6051370) (← links)
• A literature survey of matrix methods for data science (Q6068265) (← links)
• Inexact penalty decomposition methods for optimization problems with geometric constraints (Q6133301) (← links)
• Polynomial whitening for high-dimensional data (Q6178887) (← links)