Luis Rademacher - Concepedia

Author

Luis Rademacher

The Ohio State University ORCID

Also Known As

Belkin, Mikhail, L. Rademacher, LUIS RADEMACHER, Luis A. Rademacher, Luis Rademacher, Rademacher, Luis

Publications

900

Citations

H-Index

Concepts

All Affiliations

The Ohio State University Georgia Institute of Technology Microsoft Research (India)Microsoft (United States)

About

Luis Rademacher is an author at The Ohio State University specializing in engineering, computer science, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	9	9	598
2	Computer Science	8	8	515
3	Education	3	3	75
4	Data Science	2	2	204
5	Natural Sciences	1	1	19

Luis Rademacher

Publications

658

Citations

H-Index

Page 1

	Year	Citations
Efficient Volume Sampling for Row/Column Subset Selection Amit Deshpande, Luis Rademacher Spectral TheoryEngineeringComputational ComplexityMatrix TheoryCombinatorial Data Analysis	2010	187
Matrix approximation and projective clustering via volume sampling Amit Deshpande, Luis Rademacher, Santosh Vempala, Low-rank ApproximationEngineeringMatrix FactorizationHigh-dimensional MethodRelative Approximation	2006	174
Matrix approximation and projective clustering via volume sampling Amit Deshpande, Luis Rademacher, Santosh Vempala, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 Low-rank ApproximationEngineeringDimensionality ReductionComputational GeometryApproximation Theory	2006	83
Expanders via random spanning trees Navin Goyal, Luis Rademacher, Santosh Vempala arXiv (Cornell University) Mathematical ProgrammingNetwork ScienceGraph TheoryEngineeringNetwork Algorithm	2009	45
Approximating the centroid is hard Luis Rademacher Numerical AnalysisMathematical ProgrammingPade ApproximantDiscrete GeometryInertia Matrix	2007	43
The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures Joseph Anderson, Mikhail Belkin, Navin Goyal, arXiv (Cornell University)	2013	29
Learning convex bodies is hard Navin Goyal, Luis Rademacher ArXiv.org Relative Symmetric DifferenceGeometric LearningEngineeringMachine LearningComputational Complexity	2009	19
Blind Signal Separation in the Presence of Gaussian Noise Mikhail A. Belkin, Luis Rademacher, James Voss Source SeparationEngineeringMachine LearningNoise ReductionSpeech Recognition	2013	17
Expanders via Random Spanning Trees Navin Goyal, Luis Rademacher, Santosh Vempala Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms Mathematical ProgrammingEngineeringNetwork AnalysisEducationComputational Complexity	2009	17
Expanders via Random Spanning Trees Alan Frieze, Navin Goyal, Luis Rademacher, SIAM Journal on Computing Mathematical ProgrammingRandom Spanning TreesNetwork ScienceGraph TheoryEngineering	2014	13

Page 1