Pages that link to "Item:Q1121912"

The following pages link to The Johnson-Lindenstrauss lemma and the sphericity of some graphs (Q1121912):

Displaying 29 items.

• Near-optimal encoding for sigma-delta quantization of finite frame expansions (Q485203) (← links)
• Dimensionality reduction with subgaussian matrices: a unified theory (Q515989) (← links)
• Dense fast random projections and Lean Walsh transforms (Q629831) (← links)
• R3P-Loc: a compact multi-label predictor using ridge regression and random projection for protein subcellular localization (Q739656) (← links)
• Some geometric applications of the beta distribution (Q804064) (← links)
• On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes (Q817830) (← links)
• An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
• A simple proof of the restricted isometry property for random matrices (Q1039884) (← links)
• Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451) (← links)
• Embedding of trees in Euclidean spaces (Q1100211) (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
• On embedding of graphs into Euclidean spaces of small dimension (Q1204473) (← links)
• Certifying smoothness of discrete functions and measuring legitimacy of images (Q1263300) (← links)
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins. (Q1401965) (← links)
• Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
• Latent semantic indexing: A probabilistic analysis (Q1591153) (← links)
• Efficient clustering on Riemannian manifolds: a kernelised random projection approach (Q1669725) (← links)
• Fast, linear time, \(m\)-adic hierarchical clustering for search and retrieval using the Baire metric, with linkages to generalized ultrametrics, hashing, formal concept analysis, and precision of data measurement (Q1760308) (← links)
• Embeddings of graphs in Euclidean spaces (Q1812683) (← links)
• On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
• The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
• The perfect marriage and much more: combining dimension reduction, distance measures and covariance (Q2164274) (← links)
• Sphericity, cubicity, and edge clique covers of graphs (Q2495913) (← links)
• An algorithmic theory of learning: Robust concepts and random projection (Q2499543) (← links)
• Monotone maps, sphericity and bounded second eigenvalue (Q2573647) (← links)
• Random projections and Hotelling’s T2 statistics for change detection in high-dimensional data streams (Q2872879) (← links)
• Fast Phase Retrieval from Local Correlation Measurements (Q3179618) (← links)
• Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
• \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\) (Q6145674) (← links)