default search action
Rameshwar Pratap
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j12]Bhisham Dev Verma, Punit Pankaj Dubey, Rameshwar Pratap, Manoj Thakur:
Improving compressed matrix multiplication using control variate method. Inf. Process. Lett. 187: 106517 (2025) - 2024
- [j11]Bhisham Dev Verma, Rameshwar Pratap, Manoj Thakur:
Unbiased estimation of inner product via higher order count sketch. Inf. Process. Lett. 183: 106407 (2024) - [j10]Bhisham Dev Verma, Rameshwar Pratap, Punit Pankaj Dubey:
Sparsifying Count Sketch. Inf. Process. Lett. 186: 106490 (2024) - [i21]Bhisham Dev Verma, Rameshwar Pratap:
Improving LSH via Tensorized Random Projection. CoRR abs/2402.07189 (2024) - 2023
- [j9]Amit Deshpande, Rameshwar Pratap:
One-Pass Additive-Error Subset Selection for ℓ p Subspace Approximation and (k, p)-Clustering. Algorithmica 85(10): 3144-3167 (2023) - [j8]Eric Allender, Nikhil Balaji
, Samir Datta, Rameshwar Pratap:
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs. Comput. 12(2): 145-173 (2023) - [j7]Debajyoti Bera
QUINT: Node Embedding Using Network Hashing. IEEE Trans. Knowl. Data Eng. 35(3): 2987-3000 (2023) - [j6]Debajyoti Bera
Dimensionality Reduction for Categorical Data. IEEE Trans. Knowl. Data Eng. 35(4): 3658-3671 (2023) - [c24]Gopal Chamarthi, Adarsh Patel, Rameshwar Pratap:
Towards obtaining SEP via Orthogonality of Projection Matrix in massive MIMO Networks. ANTS 2023: 1-3 - [c23]Rameshwar Pratap
Minwise-Independent Permutations with Insertion and Deletion of Features. SISAP 2023: 171-184 - [c22]Gopal Chamarthi, Adarsh Patel, Rameshwar Pratap:
Random Projection Based Efficient Detector in Massive MIMO Communication Networks. SPAWC 2023: 426-430 - [i20]Rameshwar Pratap, Raghav Kulkarni:
Minwise-Independent Permutations with Insertion and Deletion of Features. CoRR abs/2308.11240 (2023) - [i19]Amit Deshpande, Rameshwar Pratap:
Improved Outlier Robust Seeding for k-means. CoRR abs/2309.02710 (2023) - 2022
- [j5]Bhisham Dev Verma, Rameshwar Pratap, Debajyoti Bera
Efficient binary embedding of categorical data using BinSketch. Data Min. Knowl. Discov. 36(2): 537-565 (2022) - [j4]Bhisham Dev Verma, Rameshwar Pratap, Manoj Thakur:
Variance reduction in feature hashing using MLE and control variate method. Mach. Learn. 111(7): 2631-2662 (2022) - [c21]Amit Deshpande, Rameshwar Pratap:
One-Pass Additive-Error Subset Selection for ℓp Subspace Approximation. ICALP 2022: 51:1-51:14 - [c20]Punit Pankaj Dubey, Bhisham Dev Verma, Rameshwar Pratap, Keegan Kang
Improving sign-random-projection via count sketch. UAI 2022: 599-609 - [i18]Rameshwar Pratap, Bhisham Dev Verma, Raghav Kulkarni:
Improving \textit{Tug-of-War} sketch using Control-Variates method. CoRR abs/2203.02432 (2022) - [i17]Amit Deshpande, Rameshwar Pratap:
One-pass additive-error subset selection for 𝓁p subspace approximation. CoRR abs/2204.12073 (2022) - [i16]Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap:
On the Complexity of Algebraic Numbers, and the Bit-Complexity of Straight-Line Programs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j3]Amit Deshpande, Rameshwar Pratap
Sampling-based dimension reduction for subspace approximation with outliers. Theor. Comput. Sci. 858: 100-113 (2021) - [c19]Rameshwar Pratap, Bhisham Dev Verma, Raghav Kulkarni:
Improving Tug-of-War sketch using Control-Variates method. ACDA 2021: 66-76 - [c18]Keegan Kang
Improving Hashing Algorithms for Similarity Search \textitvia MLE and the Control Variates Trick. ACML 2021: 814-829 - [c17]Rameshwar Pratap, Suryakant Bhardwaj, Hrushikesh Sudam Sarode, Raghav Kulkarni:
Feature Hashing with Insertion and Deletion of Features. IEEE BigData 2021: 888-898 - [c16]Rameshwar Pratap, Raghav Kulkarni:
Variance reduction in frequency estimators via control variates method. UAI 2021: 183-193 - [i15]Amit Deshpande, Rameshwar Pratap:
On Subspace Approximation and Subset Selection in Fewer Passes by MCMC Sampling. CoRR abs/2103.11107 (2021) - [i14]Debajyoti Bera, Rameshwar Pratap, Bhisham Dev Verma, Biswadeep Sen, Tanmoy Chakraborty:
QUINT: Node embedding using network hashing. CoRR abs/2109.04206 (2021) - [i13]Bhisham Dev Verma, Rameshwar Pratap, Debajyoti Bera:
Efficient Binary Embedding of Categorical Data using BinSketch. CoRR abs/2111.07163 (2021) - [i12]Debajyoti Bera, Rameshwar Pratap, Bhisham Dev Verma:
Dimensionality Reduction for Categorical Data. CoRR abs/2112.00362 (2021) - 2020
- [c15]Rameshwar Pratap, Karthik Revanuru, Anirudh Ravi, Raghav Kulkarni:
Randomness Efficient Feature Hashing for Sparse Binary Data. ACML 2020: 689-704 - [c14]Rameshwar Pratap, Anup Anand Deshmukh, Pratheeksha Nair, Anirudh Ravi:
Scaling up Simhash. ACML 2020: 705-720 - [c13]Rameshwar Pratap
Efficient Compression Algorithm for Multimedia Data. BigMM 2020: 245-250 - [c12]Amit Deshpande, Rameshwar Pratap
Subspace Approximation with Outliers. COCOON 2020: 1-13 - [c11]Avantika Singh, Pratyush Gaurav, Chirag Vashist, Aditya Nigam, Rameshwar Pratap:
IHashNet: Iris Hashing Network based on efficient multi-index hashing. IJCB 2020: 1-9 - [c10]Amit Deshpande, Praneeth Kacham, Rameshwar Pratap:
Robust k-means++. UAI 2020: 799-808 - [i11]Amit Deshpande, Rameshwar Pratap:
Subspace approximation with outliers. CoRR abs/2006.16573 (2020) - [i10]Avantika Singh, Chirag Vashist, Pratyush Gaurav, Aditya Nigam, Rameshwar Pratap:
IHashNet: Iris Hashing Network based on efficient multi-index hashing. CoRR abs/2012.03881 (2020)
2010 – 2019
- 2019
- [c9]Rameshwar Pratap
Efficient Sketching Algorithm for Sparse Binary Data. ICDM 2019: 508-517 - [i9]Rameshwar Pratap, Debajyoti Bera, Karthik Revanuru:
Efficient Sketching Algorithm for Sparse Binary Data. CoRR abs/1910.04658 (2019) - 2018
- [j2]Sourav Chakraborty, Rameshwar Pratap
Helly-Type Theorems in Property Testing. Int. J. Comput. Geom. Appl. 28(4): 365-379 (2018) - [c8]Rameshwar Pratap, Anup Anand Deshmukh, Pratheeksha Nair, Tarun Dutt:
A Faster Sampling Algorithm for Spherical k-means. ACML 2018: 343-358 - [c7]Rameshwar Pratap
Efficient Dimensionality Reduction for Sparse Binary Data. IEEE BigData 2018: 152-157 - [c6]Ishan Sohony, Rameshwar Pratap
Ensemble learning for credit card fraud detection. COMAD/CODS 2018: 289-294 - [c5]Rameshwar Pratap
Faster Coreset Construction for Projective Clustering via Low-Rank Approximation. IWOCA 2018: 336-348 - [c4]Rameshwar Pratap
Efficient Compression Technique for Sparse Sets. PAKDD (3) 2018: 164-176 - 2017
- [i8]Rameshwar Pratap, Ishan Sohony, Raghav Kulkarni:
Efficient Compression Technique for Sparse Sets. CoRR abs/1708.04799 (2017) - 2016
- [j1]Sourav Chakraborty, Akshay Kamath, Rameshwar Pratap
Testing whether the uniform distribution is a stationary distribution. Inf. Process. Lett. 116(7): 475-480 (2016) - [c3]Debajyoti Bera, Rameshwar Pratap
Frequent-Itemset Mining Using Locality-Sensitive Hashing. COCOON 2016: 143-155 - [i7]Debajyoti Bera, Rameshwar Pratap:
Frequent-Itemset Mining using Locality-Sensitive Hashing. CoRR abs/1603.01682 (2016) - [i6]Rameshwar Pratap, Sandeep Sen:
Faster coreset construction for subspace and projective clustering. CoRR abs/1606.07992 (2016) - [i5]Raghav Kulkarni, Rameshwar Pratap:
Similarity preserving compressions of high dimensional sparse data. CoRR abs/1612.06057 (2016) - 2014
- [c2]Sourav Chakraborty, Rameshwar Pratap
Helly-Type Theorems in Property Testing. LATIN 2014: 306-317 - 2013
- [i4]Sourav Chakraborty, Akshay Kamath, Rameshwar Pratap:
Testing uniformity of stationary distribution. CTW 2013: 47-50 - [i3]Sourav Chakraborty, Akshay Kamath, Rameshwar Pratap:
Testing Uniformity of Stationary Distribution. CoRR abs/1302.5366 (2013) - [i2]Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf:
Helly-Type Theorems in Property Testing. CoRR abs/1307.8268 (2013) - 2012
- [c1]Samir Datta
Computing Bits of Algebraic Numbers. TAMC 2012: 189-201 - 2011
- [i1]Samir Datta, Rameshwar Pratap:
Computing Bits of Algebraic Numbers. CoRR abs/1112.4295 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: