COMPUTING <i>k</i> CENTERS OVER STREAMING DATA FOR SMALL <i>k</i> (Q2939917): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating extent measures of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: More planar two-center algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster core-set constructions and data-stream algorithms in fixed dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Clustering and Dynamic Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive sampling for geometric problems over data streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some geometric problems in unbounded dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost space-optimal streaming algorithm for coresets in fixed dimensions / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218195914500058 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4234153766 / rank
 
Normal rank

Latest revision as of 11:23, 30 July 2024

scientific article
Language Label Description Also known as
English
COMPUTING <i>k</i> CENTERS OVER STREAMING DATA FOR SMALL <i>k</i>
scientific article

    Statements

    COMPUTING <i>k</i> CENTERS OVER STREAMING DATA FOR SMALL <i>k</i> (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 January 2015
    0 references
    0 references
    streaming algorithms
    0 references
    \(k\)-center
    0 references
    approximation algorithms
    0 references
    0 references