On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of heuristics for the weighted matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic approximation algorithms for clustering problems in high dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter, width, closest line pair, and parametric searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Central limit theorems for empirical measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the diameter of a set of points in the Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Distances of n Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Johnson-Lindenstrauss lemma and the sphericity of some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some basic problems in computational convexity. I. Containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Printer graphics for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic algorithm for the three-dimensional diameter problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4253255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank

Latest revision as of 10:26, 5 June 2024

scientific article
Language Label Description Also known as
English
On computing the diameter of a point set in high dimensional Euclidean space.
scientific article

    Statements

    On computing the diameter of a point set in high dimensional Euclidean space. (English)
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers