The following pages link to Petros Drineas (Q861019):
Displayed 42 items.
- CUR matrix decompositions for improved data analysis (Q134075) (← links)
- Item:Q861019 (redirect page) (← links)
- Clustering large graphs via the singular value decomposition (Q703073) (← links)
- A randomized algorithm for a tensor-based generalization of the singular value decomposition (Q861021) (← links)
- Random projections for the nonnegative least-squares problem (Q1030739) (← links)
- A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality (Q1944905) (← links)
- A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world (Q2170129) (← links)
- A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix (Q2404966) (← links)
- Feature selection for linear SVM with provable guarantees (Q2417820) (← links)
- Structural conditions for projection-cost preservation via randomized matrix multiplication (Q2419040) (← links)
- The Fast Cauchy Transform and Faster Robust Linear Regression (Q2812147) (← links)
- Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering (Q2978788) (← links)
- (Q3093333) (← links)
- Low-Rank Matrix Approximations Do Not Need a Singular Value Gap (Q3119542) (← links)
- Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (Q3503606) (← links)
- Competitive recommendation systems (Q3579179) (← links)
- (Q3579418) (← links)
- Sampling Algorithms and Coresets for $\ell_p$ Regression (Q3642876) (← links)
- (Q4252300) (← links)
- (Q4415041) (← links)
- (Q4471298) (← links)
- (Q4633910) (← links)
- Recovering PCA from Hybrid-$(\ell_1,\ell_2)$ Sparse Sampling of Data Elements (Q4636984) (← links)
- Fast Universalization of Investment Strategies (Q4651523) (← links)
- (Q4737217) (← links)
- (Q5121145) (← links)
- Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices (Q5124482) (← links)
- Tensor-CUR Decompositions for Tensor-Based Data (Q5320720) (← links)
- Near-Optimal Coresets for Least-Squares Regression (Q5346331) (← links)
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces (Q5373926) (← links)
- Feature Selection for Ridge Regression with Provable Guarantees (Q5380416) (← links)
- (Q5405231) (← links)
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication (Q5470749) (← links)
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix (Q5470750) (← links)
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition (Q5470751) (← links)
- Learning Theory (Q5473620) (← links)
- Near-Optimal Column-Based Matrix Reconstruction (Q5494935) (← links)
- Near Optimal Column-Based Matrix Reconstruction (Q5495020) (← links)
- STACS 2005 (Q5710711) (← links)
- Low‐rank updates of matrix square roots (Q6125118) (← links)
- Sublinear Time Eigenvalue Approximation via Random Sampling (Q6377789) (← links)
- On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming (Q6390065) (← links)