A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum (Q3186828): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3863698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2998954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for two-cluster partition of a set of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Statistical Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank

Revision as of 10:06, 12 July 2024

scientific article
Language Label Description Also known as
English
A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum
scientific article

    Statements

    A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum (English)
    0 references
    0 references
    0 references
    12 August 2016
    0 references
    search for vector subset
    0 references
    randomized algorithm
    0 references
    asymptotical exactness
    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