Efficient subspace approximation algorithms (Q664540): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00454-011-9384-2 / rank
Normal rank
 
Property / author
 
Property / author: Kasturi R. Varadarajan / rank
Normal rank
 
Property / author
 
Property / author: Kasturi R. Varadarajan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-011-9384-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3137387293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5290249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate clustering via core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the robustness of multivariate medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic optimization: The Fermat-Weber location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling-based dimension reduction for subspace approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Sampling and Fast Low-Rank Matrix Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix approximation and projective clustering via volume sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous location of dimensional structures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling algorithms for <i>l</i><sub>2</sub> regression and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast monte-carlo algorithms for finding low-rank approximations / 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: Fast Construction of Nets in Low-Dimensional Metrics and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to get close to the median shape / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projective clustering in high dimensions using core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional shape fitting in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870155 / 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: Approximating the Radii of Point Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00454-011-9384-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:22, 10 December 2024

scientific article
Language Label Description Also known as
English
Efficient subspace approximation algorithms
scientific article

    Statements

    Efficient subspace approximation algorithms (English)
    0 references
    2 March 2012
    0 references
    dimension reduction
    0 references
    low-rank approximation
    0 references
    shape fitting
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers