scientific article; zbMATH DE number 7053258
From MaRDI portal
Publication:5743377
zbMath1423.28031MaRDI QIDQ5743377
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095121
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Metric spaces, metrizability (54E35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Classical measure theory (28A99) Combinatorial probability (60C99)
Related Items (2)
On eigenvalues of random complexes ⋮ Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hardness of embedding simplicial complexes in \(\mathbb R^d\)
- Cuts, trees and \(\ell_1\)-embeddings of graphs
- Isometric embedding in \(\ell_ p\)-spaces
- An exact result for 3-graphs
- Homological connectivity of random 2-complexes
- On Lipschitz embedding of finite metric spaces in Hilbert space
- On sparse spanners of weighted graphs
- Sharper bounds for Gaussian and empirical processes
- Approximating the bandwidth via volume respecting embeddings
- Embedding the diamond graph in \(L_p\) and dimension reduction in \(L_1\)
- The fundamental group of random 2-complexes
- Embedding Subspaces of L 1 into l N 1
- Extensions of Lipschitz mappings into a Hilbert space
- Near Optimal Dimensionality Reductions That Preserve Volumes
- On the impossibility of dimension reduction in l 1
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- On Approximating the Average Distance Between Points
- Homological connectivity of random k -dimensional complexes
- Twice-ramanujan sparsifiers
- Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
- A Moore bound for simplicial complexes
- Minors in random and expanding hypergraphs
- A unified framework for approximating and clustering data
- Topological characteristics of random triangulated surfaces
- Near Linear Lower Bound for Dimension Reduction in L1
- Geometric discrepancy. An illustrated guide
- Improved bounds on the sample complexity of learning
This page was built for publication:
