Theses most similar to Nearly tight oblivious subspace embeddings by trace inequalities (Cohen, Michael B.; 2016) read it

Order computations in generic groups

Sutherland, Andrew V (2007)

  • Advisor: Michael F. Sipser
  • Department of Mathematics
Read it

Advances in sparse signal recovery methods

Berinde, Radu (2009)

  • Advisor: Piotr Indyk
  • Department of Electrical Engineering and Computer Science
Read it

Large-deviation analysis and applications Of learning tree-structured graphical models

Tan, Vincent Yan Fu (2011)

  • Advisor: Alan S. Willsky
  • Department of Electrical Engineering and Computer Science
Read it

Sketching and streaming high-dimensional vectors

Nelson, Jelani (Jelani Osei) (2011)

  • Advisors: Erik D. Demaine; Piotr Indyk
  • Department of Electrical Engineering and Computer Science
Read it

On inference about rare events

Ohannessian, Mesrob I., 1981- (2012)

  • Advisors: Munther A. Dahleh; Sanjoy K. Mitter
  • Department of Electrical Engineering and Computer Science
Read it

Faster fully polynomial approximation schemes for Knapsack problems

Rhee, Donguk (2015)

  • Advisor: James B. Orlin
  • Operations Research Center
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

Dimensionality reduction for k-means clustering

Musco, Cameron N. (Cameron Nicholas) (2015)

  • Advisor: Nancy A. Lynch
  • Department of Electrical Engineering and Computer Science
Read it

Blind regression : understanding collaborative filtering from matrix completion to tensor completion

Li, Yihu (2016)

  • Advisor: Devavrat Shah
  • Department of Electrical Engineering and Computer Science
Read it

Testing properties of Ising models

Dikkala, Sai Nishanth (2017)

  • Advisor: Constantinos Daskalakis
  • Department of Electrical Engineering and Computer Science
Read it