Skip to content
<title>Channels - New Bounds for Kernel Sums via Fast Spherical Embeddings :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
New Bounds for Kernel Sums via Fast Spherical Embeddings
Search for more channels:
Similar Items: New Bounds for Kernel Sums via Fast Spherical Embeddings
Channel Options
View Record
Explore related channels
Quick Look
Fast decremental tree sums in forests
Quick Look
On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
Quick Look
Robust Inverse Quadratic Error Decay with Meshing and Beam Search for Random Subset Sum
Quick Look
Online Monotone Metric Embeddings
Quick Look
Fast Monte-Carlo
Quick Look
Upward-Planar Drawings with Bounded Span
Quick Look
Nearly-Tight Bounds for Zonotope Containment and Beyond
Quick Look
Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch
Quick Look
New Diameter Approximations via Distance Oracle Techniques
Quick Look
A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
Quick Look
Distributed Santa Claus via Global Rounding
Quick Look
Faster Mixing for Triangulations via Transport Flows
Quick Look
Set Parameterized Matching via Multi-Layer Hashing
Quick Look
Small Independent Sets versus Small Separator in Geometric Intersection Graphs
Quick Look
On (In)approximability of MaxMin Independent Set Reconfiguration
Quick Look
Solving Positive Linear Programs with Differential Privacy
Quick Look
Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
Quick Look
Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
Quick Look
Strict Hierarchy for Quantum Channel Certification to Unitary
Quick Look
Improved Approximation Algorithm for Maximum Balanced Biclique
Quick Look
Designing sparse temporal graphs satisfying connectivity requirements
Quick Look
A note on the parameter $ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
Quick Look
Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
Quick Look
Smallest suffixient set maintenance in near-real-time
Load more items
View Record
Prev
Explore related channels
Next
