Sam Elder
Artificial Intelligence · 2014
A researcher in the Science corpus: 1 paper; trusts 7 researchers and is trusted by 2 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 14 citations into it; #26,615 of 35,345 by trust here, #23,731 by citations
- Computational Mechanics — 13 citations into it; #7,492 of 10,001 by trust here, #5,813 by citations
- Computational Theory and Mathematics — 11 citations into it; #9,165 of 12,182 by trust here, #6,165 by citations
- Computer Vision and Pattern Recognition — 9 citations into it
- Signal Processing — 5 citations into it
Whom Sam Elder trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Sariel Har-Peled
- Michael W. Mahoney
- Tamás Sarlós
- David P. Woodruff
- Long Chen
- Kenneth L. Clarkson
- Daniel M. Kane
- R. Kannan
- Dan Feldman
- Amit Deshpande
Who trusts Sam Elder overall
Papers from Sam Elder's perspective
Ordered by how strongly the researchers Sam Elder trusts endorse each paper. Same corpus, a different order for every researcher.
- Improved Approximation Algorithms for Large Matrices via Random Projections (IEEE Annual Symposium on Foundations of Computer Science)
- Numerical linear algebra in the streaming model (Symposium on the Theory of Computing)
- Matrix approximation and projective clustering via volume sampling (ACM-SIAM Symposium on Discrete Algorithms)
- OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings (IEEE Annual Symposium on Foundations of Computer Science)
- FINDING STRUCTURE WITH RANDOMNESS : PROBABILISTIC ALGORITHMS FOR CONSTRUCTING
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression (Symposium on the Theory of Computing)
- Turning big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering (ACM-SIAM Symposium on Discrete Algorithms)
- Low-Rank Approximation and Regression in Input Sparsity Time (arXiv.org)
- k-means++: the advantages of careful seeding
- Clustering Large Graphs via the Singular Value Decomposition (Machine-mediated learning)
Their papers
- Dimensionality Reduction for k-Means Clustering and Low Rank Approximation (2014) — 380 citations