Theses most similar to Approximate nearest neighbor and its many variants (Mahabadi, Sepideh; 2013) read it

New geometric techniques for linear programming and graph partitioning

Kelner, Jonathan, 1980- (2006)

  • Advisors: Daniel A. Spielman; Madhu Sudan
  • Department of Electrical Engineering and Computer Science
Read it

Sampling-based algorithms for dimension reduction

Deshpande, Amit Jayant (2007)

  • Advisors: Daniel A. Spielman; Santosh Vempala
  • Department of Mathematics
Read it

Asymptotic and computational problems in single-link clustering

Tabakis, Evangelos (1992)

  • Advisor: Richard M. Dudley
  • Department of Mathematics
Read it

Algorithms and lower bounds for sparse recovery

Price, Eric (Eric C.) (2010)

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

Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs

Telha Cornejo, Claudio (Claudio A.) (2012)

  • Advisor: Andreas S. Schulz
  • Operations Research Center
Read it

Clustering in high dimensions

Bădoiu, Mihai, 1978- (2003)

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

Conformal loop ensembles and the Gaussian free field

Watson, Samuel Stewart, 1986- (2015)

  • Advisor: Scott R. Sheffield
  • Department of Mathematics
Read it

Sublinear-time algorithms for counting star subgraphs with applications to join selectivity estimation

Peebles, John Lee Thompson, Jr (2016)

  • Advisors: Jon Kelne; Ronitt Rubinfeld
  • Department of Electrical Engineering and Computer Science
Read it

Algorithmic embeddings

Bădoiu, Mihai, 1978- (2006)

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

Computational metric embeddings

Sidiropoulos, Anastasios (2008)

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