Nirman Kumar

Orcid: 0000-0001-6601-2790

According to our database1, Nirman Kumar authored at least 28 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Parallelizable efficient large order multiple recursive generators.
Parallel Comput., September, 2023

RTRA: Rapid Training of Regularization-based Approaches in Continual Learning.
CoRR, 2023

DSS: A Diverse Sample Selection Method to Preserve Knowledge in Class-Incremental Learning.
CoRR, 2023

PBES: PCA Based Exemplar Sampling Algorithm for Continual Learning.
CoRR, 2023

2021
An Information-theoretic approach to dimensionality reduction in data science.
Int. J. Data Sci. Anal., 2021

Red blue $k$-center clustering with distance constraints.
CoRR, 2021

Separated Red Blue Center Clustering.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
CIDMP: Completely Interpretable Detection of Malaria Parasite in Red Blood Cells using Lower-dimensional Feature Space.
Proceedings of the 2020 International Joint Conference on Neural Networks, 2020

2019
Approximating Distance Measures for the Skyline.
Proceedings of the 22nd International Conference on Database Theory, 2019

2018
Range-max queries on uncertain data.
J. Comput. Syst. Sci., 2018

Robust Proximity Search for Balls Using Sublinear Space.
Algorithmica, 2018

Faster Approximation Algorithm for the <i>k</i>-Regret Minimizing Set and Related Problems.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Hyperplane separability and convexity of probabilistic point sets.
J. Comput. Geom., 2017

Efficient Algorithms for k-Regret Minimizing Sets.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Joint sensing duty cycle scheduling for heterogeneous coverage guarantee.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

On the minimum edge size for 2-colorability and realizability of hypergraphs by axis-parallel rectangles.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Space Exploration via Proximity Search.
Discret. Comput. Geom., 2016

Containment and Evasion in Stochastic Point Data.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Most Likely Voronoi Diagrams in Higher Dimensions.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
Approximating Minimization Diagrams and Generalized Proximity Search.
SIAM J. Comput., 2015

Fast Compaction Algorithms for NoSQL Databases.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2014
In search of better proximity
PhD thesis, 2014

Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space.
SIAM J. Comput., 2014

2013
Approximate Nearest Neighbor Search for Low-Dimensional Queries.
SIAM J. Comput., 2013

Fault Tolerant Clustering Revisited.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2011
Down the Rabbit Hole: Robust Proximity Search in Sublinear Space
CoRR, 2011

2005
On the Complexity of Error Explanation.
Proceedings of the Verification, 2005

2003
A Rewriting Based Model for Probabilistic Distributed Object Systems.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2003


  Loading...