The following pages link to Rameshwar Pratap (Q269728):
Displaying 14 items.
- Testing whether the uniform distribution is a stationary distribution (Q269729) (← links)
- Faster coreset construction for projective clustering via low-rank approximation (Q1671019) (← links)
- Subspace approximation with outliers (Q2019429) (← links)
- Variance reduction in feature hashing using MLE and control variate method (Q2102328) (← links)
- Efficient binary embedding of categorical data using BinSketch (Q2134033) (← links)
- Sampling-based dimension reduction for subspace approximation with outliers (Q2222095) (← links)
- Frequent-Itemset Mining Using Locality-Sensitive Hashing (Q2817857) (← links)
- Computing Bits of Algebraic Numbers (Q2898030) (← links)
- Helly-Type Theorems in Property Testing (Q4631011) (← links)
- Helly-Type Theorems in Property Testing (Q5405049) (← links)
- (Q5420026) (← links)
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering (Q6046948) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- Unbiased estimation of inner product via higher order count sketch (Q6072197) (← links)
