Theses most similar to Sampling-based algorithms for dimension reduction (Deshpande, Amit Jayant; 2007) read it

Clustering via matrix exponentiation

Zhou, Hanson M. (Hanson Mi), 1977- (2003)

  • Advisor: Santosh Vempala
  • Department of Electrical Engineering and Computer Science
Read it

Techniques for computing with low-independence randomness

Rompel, John Taylor (1990)

  • Advisor: Frank Thomson Leighton
  • Department of Electrical Engineering and Computer Science
Read it

Algorithms for data mining

Wang, Grant J. (Grant Jenhorn), 1979- (2006)

  • Advisor: Santosh Vempala
  • Department of Electrical Engineering and Computer Science
Read it

Computational learning theory : new models and algorithms

Sloan, Robert Hal (1989)

  • Advisor: Ronald L. Rivest
  • Department of Electrical Engineering and Computer Science
Read it

On the hardness of the shortest vector problem

Micciancio, Daniele (1998)

  • Advisor: Shafi Goldwasser
  • Department of Electrical Engineering and Computer Science
Read it

Testing and learning Boolean functions

Matulef, Kevin Michael (2009)

  • Advisor: Ronitt Rubinfeld
  • Department of Mathematics
Read it

High-dimensional econometrics and model selection

Luo, Ye (2015)

  • Advisors: Jerry A. Hausman; Victor Chernozhukov
  • Department of Economics
Read it

Approximate k-means clustering through random projections

Persu, Elena-Mădălina (2015)

  • Advisor: Ankur Moitra
  • Department of Electrical Engineering and Computer Science
Read it

Dimensionality reduction for sparse and structured matrices

Musco, Christopher Paul (2015)

  • Advisors: Jonathan A. Kelner; Martin C. Rinard
  • Department of Electrical Engineering and Computer Science
Read it

Efficient algorithms for learning mixture models

Huang, Qingqin (2016)

  • Advisor: Munther A. Dahleh
  • Department of Electrical Engineering and Computer Science
Read it