Skip to content
Channels - Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
Search for more channels:
Similar Items: Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
Channel Options
View Record
Explore related channels
Quick Look
Ranking with Partitioning
Quick Look
Dynamic Rank, Basis, and Matching
Quick Look
Fast Monte-Carlo
Quick Look
A Scalable and Unified Framework to Weighted Rank Aggregation
Quick Look
The Impact of Approximation on Algorithmic Progress
Quick Look
On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
Quick Look
Fast decremental tree sums in forests
Quick Look
Exact and Approximate Algorithms for Polytree Learning
Quick Look
Accelerated Relax-and-Round for Concave Coverage Problems
Quick Look
On (In)approximability of MaxMin Independent Set Reconfiguration
Quick Look
Improved Approximation Algorithm for Maximum Balanced Biclique
Quick Look
On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
Quick Look
New Diameter Approximations via Distance Oracle Techniques
Quick Look
Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
Quick Look
An Exact 56-Addition, Rank-23 Scheme for General 3*3 Matrix Multiplication
Quick Look
Modern column generation for estimating single- and multi-purchase ranked list choice models
Quick Look
New Bounds for Kernel Sums via Fast Spherical Embeddings
Quick Look
Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases
Quick Look
A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
Quick Look
FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
Quick Look
An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
Quick Look
On the power of standard DFS and BFS
Quick Look
Small Independent Sets versus Small Separator in Geometric Intersection Graphs
Quick Look
Solving Positive Linear Programs with Differential Privacy
Load more items
View Record
Prev
Explore related channels
Next