Rameshwar Pratap

Manoj Thakur

Inf. Process. Lett., January, 2024

Improving LSH via Tensorized Random Projection.

[BibT_eX]

[DOI]

CoRR, 2024

2023

One-Pass Additive-Error Subset Selection for ℓ p Subspace Approximation and (k, p)-Clustering.

[BibT_eX]

[DOI]

Algorithmica, October, 2023

Dimensionality Reduction for Categorical Data.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., April, 2023

QUINT: Node Embedding Using Network Hashing.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., March, 2023

Improved Outlier Robust Seeding for k-means.

[BibT_eX]

[DOI]

CoRR, 2023

Random Projection Based Efficient Detector in Massive MIMO Communication Networks.

[BibT_eX]

[DOI]

Gopal Chamarthi

Adarsh Patel

Proceedings of the 24th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2023

Minwise-Independent Permutations with Insertion and Deletion of Features.

[BibT_eX]

[DOI]

Proceedings of the Similarity Search and Applications - 16th International Conference, 2023

Towards obtaining SEP via Orthogonality of Projection Matrix in massive MIMO Networks.

[BibT_eX]

[DOI]

Gopal Chamarthi

Adarsh Patel

Proceedings of the IEEE International Conference on Advanced Networks and Telecommunications Systems, 2023

2022

Variance reduction in feature hashing using MLE and control variate method.

[BibT_eX]

[DOI]

Manoj Thakur

Mach. Learn., 2022

On the Complexity of Algebraic Numbers, and the Bit-Complexity of Straight-Line Programs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2022

Efficient binary embedding of categorical data using BinSketch.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2022

Improving \textit{Tug-of-War} sketch using Control-Variates method.

[BibT_eX]

[DOI]

CoRR, 2022

Improving sign-random-projection via count sketch.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty in Artificial Intelligence, 2022

One-Pass Additive-Error Subset Selection for ℓp Subspace Approximation.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Sampling-based dimension reduction for subspace approximation with outliers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On Subspace Approximation and Subset Selection in Fewer Passes by MCMC Sampling.

[BibT_eX]

[DOI]

CoRR, 2021

Variance reduction in frequency estimators via control variates method.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Feature Hashing with Insertion and Deletion of Features.

[BibT_eX]

[DOI]

Suryakant Bhardwaj

Hrushikesh Sudam Sarode

Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), 2021

Improving Hashing Algorithms for Similarity Search \textitvia MLE and the Control Variates Trick.

[BibT_eX]

[DOI]

Proceedings of the Asian Conference on Machine Learning, 2021

Improving Tug-of-War sketch using Control-Variates method.

[BibT_eX]

[DOI]

Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020

Robust k-means++.

[BibT_eX]

[DOI]

Praneeth Kacham

Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

IHashNet: Iris Hashing Network based on efficient multi-index hashing.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Joint Conference on Biometrics, 2020

Subspace Approximation with Outliers.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Efficient Compression Algorithm for Multimedia Data.

[BibT_eX]

[DOI]

Proceedings of the 6th IEEE International Conference on Multimedia Big Data, 2020

Randomness Efficient Feature Hashing for Sparse Binary Data.

[BibT_eX]

[DOI]

Proceedings of The 12th Asian Conference on Machine Learning, 2020

Scaling up Simhash.

[BibT_eX]

[DOI]

Proceedings of The 12th Asian Conference on Machine Learning, 2020

2019

Efficient Sketching Algorithm for Sparse Binary Data.

[BibT_eX]

[DOI]

Karthik Revanuru

Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

2018

Helly-Type Theorems in Property Testing.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2018

Efficient Compression Technique for Sparse Sets.

[BibT_eX]

[DOI]

Ishan Sohony

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2018

Faster Coreset Construction for Projective Clustering via Low-Rank Approximation.

[BibT_eX]

[DOI]

Sandeep Sen

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Ensemble learning for credit card fraud detection.

[BibT_eX]

[DOI]

Ishan Sohony

Ullas Nambiar

Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, 2018

Efficient Dimensionality Reduction for Sparse Binary Data.

[BibT_eX]

[DOI]

Ishan Sohony

Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

A Faster Sampling Algorithm for Spherical $k$-means.

[BibT_eX]

[DOI]

Proceedings of The 10th Asian Conference on Machine Learning, 2018

2016

Testing whether the uniform distribution is a stationary distribution.

[BibT_eX]

[DOI]

Sourav Chakraborty

Akshay Kamath

Inf. Process. Lett., 2016

Faster coreset construction for subspace and projective clustering.

[BibT_eX]

[DOI]

Sandeep Sen

CoRR, 2016

Similarity preserving compressions of high dimensional sparse data.

[BibT_eX]

[DOI]

CoRR, 2016

Frequent-Itemset Mining Using Locality-Sensitive Hashing.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2013

Testing uniformity of stationary distribution.

[BibT_eX]

Sourav Chakraborty

Akshay Kamath

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Computing Bits of Algebraic Numbers.

[BibT_eX]

[DOI]

Samir Datta