Pages that link to "Item:Q2939794"

The following pages link to Computational Advertising: Techniques for Targeting Relevant Ads (Q2939794):

Displaying 39 items.

• Matrix sketching for supervised classification with imbalanced classes (Q832649) (← links)
• Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
• Numerical algorithms for high-performance computational science (Q4993515) (← links)
• Sharper Bounds for Regularized Data Fitting (Q5002630) (← links)
• High Probability Frequency Moment Sketches (Q5002734) (← links)
• Querying a Matrix Through Matrix-Vector Products. (Q5091255) (← links)
• Optimality of linear sketching under modular updates (Q5091764) (← links)
• On the Complexity of Robust PCA and <i>ℓ</i>₁-Norm Low-Rank Matrix Approximation (Q5219689) (← links)
• Fast approximate computations with Cauchy matrices and polynomials (Q5270834) (← links)
• Towards Optimal Moment Estimation in Streaming and Distributed Models (Q5875483) (← links)
• (Q5875521) (← links)
• Approximate F_2-Sketching of Valuation Functions (Q5875529) (← links)
• Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
• Zeroth-order optimization with orthogonal random directions (Q6038668) (← links)
• Generative modeling via tree tensor network states (Q6042367) (← links)
• Contour Integral Methods for Nonlinear Eigenvalue Problems: A Systems Theoretic Approach (Q6046289) (← links)
• Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions (Q6052452) (← links)
• Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems (Q6062149) (← links)
• Low-Rank Binary Matrix Approximation in Column-Sum Norm. (Q6062156) (← links)
• Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)
• A literature survey of matrix methods for data science (Q6068265) (← links)
• M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions (Q6083984) (← links)
• (Q6084355) (← links)
• Randomized Block Adaptive Linear System Solvers (Q6094749) (← links)
• Randomized Low-Rank Approximation for Symmetric Indefinite Matrices (Q6094751) (← links)
• Randomized Quasi-Optimal Local Approximation Spaces in Time (Q6097875) (← links)
• An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation (Q6101124) (← links)
• Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions (Q6116663) (← links)
• A block-randomized stochastic method with importance sampling for CP tensor decomposition (Q6126539) (← links)
• Optimal sampling designs for multidimensional streaming time series with application to power grid sensor data (Q6138630) (← links)
• Admissible subspaces and the subspace iteration method (Q6149879) (← links)
• Fast Metric Embedding into the Hamming Cube (Q6154196) (← links)
• Fast randomized numerical rank estimation for numerically low-rank matrices (Q6154411) (← links)
• Efficient Error and Variance Estimation for Randomized Matrix Computations (Q6154964) (← links)
• Global optimization using random embeddings (Q6160282) (← links)
• A fast randomized algorithm for computing an approximate null space (Q6161581) (← links)
• On randomized sketching algorithms and the Tracy-Widom law (Q6163409) (← links)
• Randomized Nyström Preconditioning (Q6166051) (← links)
• Dictionary-based model reduction for state estimation (Q6500167) (← links)