Pages that link to "Item:Q1894703"

The following pages link to The geometry of graphs and some of its algorithmic applications (Q1894703):

Displaying 37 items.

• Spectral Techniques to Explore Point Clouds in Euclidean Space, with Applications to Collective Coordinates in Structural Biology (Q5188766) (← links)
• Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
• Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition (Q5218403) (← links)
• A Splitting Augmented Lagrangian Method for Low Multilinear-Rank Tensor Recovery (Q5245843) (← links)
• Comparison of Metric Spectral Gaps (Q5402099) (← links)
• <i>L</i> ^<i>p</i> -distortion and <i>p</i> -spectral gap of finite graphs (Q5409115) (← links)
• Euclidean distortion and the sparsest cut (Q5423920) (← links)
• Algorithms – ESA 2004 (Q5464569) (← links)
• Some applications of Ball’s extension theorem (Q5469220) (← links)
• On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ (Q5499733) (← links)
• The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ ₁ (Q5501953) (← links)
• Graph-Theoretic Solutions to Computational Geometry Problems (Q5851089) (← links)
• The legacy of Jean Bourgain in geometric functional analysis (Q5854479) (← links)
• Johnson–Lindenstrauss Embeddings with Kronecker Structure (Q5885797) (← links)
• Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
• Advances in metric embedding theory (Q5894374) (← links)
• The intrinsic dimensionality of graphs (Q5900392) (← links)
• On the dimension of trees (Q5916234) (← links)
• A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
• Expanders with respect to Hadamard spaces and random graphs (Q5919792) (← links)
• On dominated \(\ell_1\) metrics (Q5939287) (← links)
• On spatial conditioning of the spectrum of discrete random Schrödinger operators (Q6039738) (← links)
• Stochastic approximation of lamplighter metrics (Q6048880) (← links)
• Spectral dimension, Euclidean embeddings, and the metric growth exponent (Q6050266) (← links)
• Least distortion Euclidean embeddings of flat tori (Q6060342) (← links)
• Random Projection Ensemble Classification with High-Dimensional Time Series (Q6079789) (← links)
• Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)
• (Q6087213) (← links)
• Approximating spaces of Nagata dimension zero by weighted trees (Q6100866) (← links)
• Polynomial growth and asymptotic dimension (Q6109881) (← links)
• Labelings vs. embeddings: on distributed and prioritized representations of distances (Q6124827) (← links)
• Norms of structured random matrices (Q6130287) (← links)
• Diversities and the generalized circumradius (Q6142370) (← links)
• Interactions of computational complexity theory and mathematics (Q6198725) (← links)
• Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)
• Towards a bilipschitz invariant theory (Q6567399) (← links)
• Negative type and bi-Lipschitz embeddings into Hilbert space (Q6601130) (← links)