Spectral Algorithms
From MaRDI portal
Publication:3653374
DOI10.1561/0400000025zbMath1191.68852OpenAlexW4205648292MaRDI QIDQ3653374
Santosh Vempala, Ravindran Kannan
Publication date: 22 December 2009
Published in: Foundations and Trends in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5a95c797ead7f316ae821b8c363713bbc14319c0
Analysis of algorithms (68W40) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (22)
Convergence details about \(k\)-DPP Monte-Carlo sampling for large graphs ⋮ A unified view of graph regularity via matrix decompositions ⋮ Perturbation of Linear Forms of Singular Vectors Under Gaussian Noise ⋮ Spectral analysis of the Gram matrix of mixture models ⋮ Clustering High-Dimensional Data via Feature Selection ⋮ Randomized algorithms in numerical linear algebra ⋮ Clustering and outlier detection using isoperimetric number of trees ⋮ A Simple SVD Algorithm for Finding Hidden Partitions ⋮ Literature survey on low rank approximation of matrices ⋮ Second order accurate distributed eigenvector computation for extremely large matrices ⋮ Parameterized low-rank binary matrix approximation ⋮ Singular vectors under random perturbation ⋮ Parameterized Low-Rank Binary Matrix Approximation ⋮ Communication-Efficient Distributed Eigenspace Estimation ⋮ Robust subspace clustering ⋮ Fixed-size determinantal point processes sampling for species phylogeny ⋮ When do birds of a feather flock together? \(k\)-means, proximity, and conic programming ⋮ Random projections for Bayesian regression ⋮ Optimality of spectral clustering in the Gaussian mixture model ⋮ Multiscale Matrix Sampling and Sublinear-Time PageRank Computation ⋮ Subsampling Algorithms for Semidefinite Programming ⋮ Many-server queues with customer abandonment: numerical analysis of their diffusion models
This page was built for publication: Spectral Algorithms
