Pages that link to "Item:Q2939794"
From MaRDI portal
The following pages link to Computational Advertising: Techniques for Targeting Relevant Ads (Q2939794):
Displaying 50 items.
- Compressed and Penalized Linear Regression (Q3391428) (← links)
- (Q4558555) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Faster Kernel Ridge Regression Using Sketching and Preconditioning (Q4588937) (← links)
- Randomized algorithms in numerical linear algebra (Q4594242) (← links)
- Max-Plus Algebraic Statistical Leverage Scores (Q4598335) (← links)
- Practical Sketching Algorithms for Low-Rank Matrix Approximation (Q4598337) (← links)
- (Q4633019) (← links)
- (Q4633051) (← links)
- (Q4633059) (← links)
- (Q4633078) (← links)
- On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models (Q4637075) (← links)
- A Practical Randomized CP Tensor Decomposition (Q4643335) (← links)
- (Q4969259) (← links)
- Randomized Sketching Algorithms for Low-Memory Dynamic Optimization (Q4989933) (← links)
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
- Numerical algorithms for high-performance computational science (Q4993515) (← links)
- An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems (Q4997835) (← links)
- (Q4998966) (← links)
- Sharper Bounds for Regularized Data Fitting (Q5002630) (← links)
- High Probability Frequency Moment Sketches (Q5002734) (← links)
- Estimating Leverage Scores via Rank Revealing Methods and Randomization (Q5006452) (← links)
- Tight Bounds for the Subspace Sketch Problem with Applications (Q5009789) (← links)
- Tensor-Structured Sketching for Constrained Least Squares (Q5021024) (← links)
- Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion (Q5025789) (← links)
- ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
- Stochastic Gradients for Large-Scale Tensor Decomposition (Q5037555) (← links)
- Low-Rank Tucker Approximation of a Tensor from Streaming Data (Q5037558) (← links)
- Semi-Infinite Linear Regression and Its Applications (Q5071432) (← links)
- Convexification with Bounded Gap for Randomly Projected Quadratic Optimization (Q5080508) (← links)
- Querying a Matrix Through Matrix-Vector Products. (Q5091255) (← links)
- Optimality of linear sketching under modular updates (Q5091764) (← links)
- Sketched Newton--Raphson (Q5093644) (← links)
- Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition (Q5099421) (← links)
- Trading Beams for Bandwidth: Imaging with Randomized Beamforming (Q5108477) (← links)
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)
- Hardness Results for Structured Linear Systems (Q5117379) (← links)
- An investigation of Newton-Sketch and subsampled Newton methods (Q5135249) (← links)
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection (Q5146626) (← links)
- Structured Random Sketching for PDE Inverse Problems (Q5146630) (← links)
- (Q5159482) (← links)
- Two-Level Nyström--Schur Preconditioner for Sparse Symmetric Positive Definite Matrices (Q5165449) (← links)
- Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views (Q5194597) (← links)
- Stochastic sub-sampled Newton method with variance reduction (Q5204645) (← links)
- Randomized Dynamic Mode Decomposition (Q5207530) (← links)
- On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation (Q5219689) (← links)
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation (Q5230655) (← links)
- Accurate Low-Rank Approximations Via a Few Iterations of Alternating Least Squares (Q5270414) (← links)
- Fast approximate computations with Cauchy matrices and polynomials (Q5270834) (← links)
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces (Q5373926) (← links)
