Rameshwar Pratap
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Improving compressed matrix multiplication using control variate method Information Processing Letters j='Information Processing Letters' a=' ' j#=30 a#=6 | 2024-09-11 | Paper |
| One-pass additive-error subset selection for \(\ell_p\) subspace approximation j=' ' a=' ' j#=6 a#=6 | 2024-06-24 | Paper |
| Sparsifying count sketch Information Processing Letters j='Information Processing Letters' a=' ' j#=30 a#=6 | 2024-06-07 | Paper |
| Unbiased estimation of inner product via higher order count sketch Information Processing Letters j='Information Processing Letters' a=' ' j#=30 a#=6 | 2023-10-12 | Paper |
| One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering Algorithmica j='Algorithmica' a=' ' j#=12 a#=6 | 2023-10-06 | Paper |
| On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 Computability j='Computability' a=' ' j#=13 a#=6 | 2023-09-13 | Paper |
| Variance reduction in feature hashing using MLE and control variate method Machine Learning j='Machine Learning' a=' ' j#=16 a#=6 | 2022-11-28 | Paper |
| Efficient binary embedding of categorical data using BinSketch Data Mining and Knowledge Discovery j='Data Mining and Knowledge Discovery' a=' ' j#=35 a#=6 | 2022-05-05 | Paper |
| Subspace approximation with outliers j=' ' a=' ' j#=6 a#=6 | 2021-04-21 | Paper |
| On Subspace Approximation and Subset Selection in Fewer Passes by MCMC Sampling j=' ' a=' ' j#=6 a#=6 | 2021-03-20 | Paper |
| Sampling-based dimension reduction for subspace approximation with outliers Theoretical Computer Science j='Theoretical Computer Science' a=' ' j#=28 a#=6 | 2021-02-03 | Paper |
| Subspace approximation with outliers j=' ' a='2006.16573' j#=6 a#=10 | 2020-06-30 | Paper |
| Helly-type theorems in property testing International Journal of Computational Geometry & Applications j='International Journal of Computational Geometry & Applications' a=' ' j#=66 a#=6 | 2019-04-24 | Paper |
| Faster coreset construction for projective clustering via low-rank approximation j=' ' a=' ' j#=6 a#=6 | 2018-09-06 | Paper |
| Frequent-itemset mining using locality-sensitive hashing Lecture Notes in Computer Science j='Lecture Notes in Computer Science' a=' ' j#=33 a#=6 | 2016-09-02 | Paper |
| Testing whether the uniform distribution is a stationary distribution Information Processing Letters j='Information Processing Letters' a=' ' j#=30 a#=6 | 2016-04-06 | Paper |
| Testing uniformity of stationary distribution j=' ' a=' ' j#=6 a#=6 | 2014-06-11 | Paper |
| Helly-type theorems in property testing LATIN 2014: Theoretical Informatics j='LATIN 2014: Theoretical Informatics' a=' ' j#=35 a#=6 | 2014-03-31 | Paper |
| Computing bits of algebraic numbers Lecture Notes in Computer Science j='Lecture Notes in Computer Science' a=' ' j#=33 a#=6 | 2012-07-16 | Paper |
Research outcomes over time
This page was built for person: Rameshwar Pratap
