The following pages link to Amit Deshpande (Q1009336):
Displaying 10 items.
- NP-hardness of Euclidean sum-of-squares clustering (Q1009338) (← links)
- Subspace approximation with outliers (Q2019429) (← links)
- Sampling-based dimension reduction for subspace approximation with outliers (Q2222095) (← links)
- Zero-One Rounding of Singular Vectors (Q2843255) (← links)
- Guruswami-Sinop Rounding without Higher Level Lasserre (Q2969612) (← links)
- (Q3002774) (← links)
- (Q4636557) (← links)
- On the Complexity of Constrained Determinantal Point Processes (Q5002639) (← links)
- Lower bounds for adaptive locally decodable codes (Q5704840) (← links)
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering (Q6046948) (← links)
