default search action
Nirman Kumar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j9]Lih-Yuan Deng, Bryan R. Winter, Jyh-Jen Horng Shiau, Henry Horng-Shing Lu, Nirman Kumar, Ching-Chi Yang
:
Parallelizable efficient large order multiple recursive generators. Parallel Comput. 117: 103036 (2023) - [i13]Sahil Nokhwal, Nirman Kumar:
PBES: PCA Based Exemplar Sampling Algorithm for Continual Learning. CoRR abs/2312.09352 (2023) - [i12]Sahil Nokhwal, Nirman Kumar:
DSS: A Diverse Sample Selection Method to Preserve Knowledge in Class-Incremental Learning. CoRR abs/2312.09357 (2023) - [i11]Sahil Nokhwal, Nirman Kumar:
RTRA: Rapid Training of Regularization-based Approaches in Continual Learning. CoRR abs/2312.09361 (2023) - 2021
- [j8]Sambriddhi Mainali
An Information-theoretic approach to dimensionality reduction in data science. Int. J. Data Sci. Anal. 12(3): 185-203 (2021) - [c20]Marzieh Eskandari, Bhavika B. Khare, Nirman Kumar:
Separated Red Blue Center Clustering. ISAAC 2021: 41:1-41:13 - [i10]Marzieh Eskandari, Bhavika B. Khare, Nirman Kumar:
Separated Red Blue Center Clustering. CoRR abs/2107.07914 (2021) - [i9]Marzieh Eskandari, Bhavika B. Khare, Nirman Kumar:
Red blue $k$-center clustering with distance constraints. CoRR abs/2107.12411 (2021) - 2020
- [c19]Anik Khan, Kishor Datta Gupta
CIDMP: Completely Interpretable Detection of Malaria Parasite in Red Blood Cells using Lower-dimensional Feature Space. IJCNN 2020: 1-8 - [i8]Anik Khan, Kishor Datta Gupta
CIDMP: Completely Interpretable Detection of Malaria Parasite in Red Blood Cells using Lower-dimensional Feature Space. CoRR abs/2007.02248 (2020)
2010 – 2019
- 2019
- [c18]Nirman Kumar, Benjamin Raichel, Stavros Sintos, Gregory Van Buskirk:
Approximating Distance Measures for the Skyline. ICDT 2019: 10:1-10:20 - 2018
- [j7]Sariel Har-Peled
Robust Proximity Search for Balls Using Sublinear Space. Algorithmica 80(1): 279-299 (2018) - [j6]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos
Range-max queries on uncertain data. J. Comput. Syst. Sci. 94: 118-134 (2018) - [c17]Nirman Kumar, Stavros Sintos:
Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems. ALENEX 2018: 62-74 - 2017
- [j5]Martin Fink, John Hershberger, Nirman Kumar, Subhash Suri:
Hyperplane separability and convexity of probabilistic point sets. J. Comput. Geom. 8(2): 32-57 (2017) - [c16]Nirman Kumar:
On the minimum edge size for 2-colorability and realizability of hypergraphs by axis-parallel rectangles. CCCG 2017: 226-231 - [c15]Kin Sum Liu, Tyler Mayer, Hao-Tsung Yang
Joint sensing duty cycle scheduling for heterogeneous coverage guarantee. INFOCOM 2017: 1-9 - [c14]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Efficient Algorithms for k-Regret Minimizing Sets. SEA 2017: 7:1-7:23 - [i7]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Efficient Algorithms for k-Regret Minimizing Sets. CoRR abs/1702.01446 (2017) - 2016
- [j4]Sariel Har-Peled
Space Exploration via Proximity Search. Discret. Comput. Geom. 56(2): 357-376 (2016) - [c13]Martin Fink, John Hershberger, Nirman Kumar, Subhash Suri:
Hyperplane Separability and Convexity of Probabilistic Point Sets. SoCG 2016: 38:1-38:16 - [c12]Nirman Kumar, Benjamin Raichel, Subhash Suri, Kevin Verbeek
Most Likely Voronoi Diagrams in Higher Dimensions. FSTTCS 2016: 31:1-31:14 - [c11]Nirman Kumar, Subhash Suri:
Containment and Evasion in Stochastic Point Data. LATIN 2016: 576-589 - [c10]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Range-Max Queries on Uncertain Data. PODS 2016: 465-476 - 2015
- [j3]Sariel Har-Peled
Approximating Minimization Diagrams and Generalized Proximity Search. SIAM J. Comput. 44(4): 944-974 (2015) - [c9]Sariel Har-Peled
Space Exploration via Proximity Search. SoCG 2015: 374-389 - [c8]Mainak Ghosh, Indranil Gupta, Shalmoli Gupta, Nirman Kumar:
Fast Compaction Algorithms for NoSQL Databases. ICDCS 2015: 452-461 - 2014
- [b1]Nirman Kumar:
In search of better proximity. University of Illinois Urbana-Champaign, USA, 2014 - [j2]Sariel Har-Peled
Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space. SIAM J. Comput. 43(4): 1486-1511 (2014) - [c7]Sariel Har-Peled
Robust Proximity Search for Balls Using Sublinear Space. FSTTCS 2014: 315-326 - [i6]Sariel Har-Peled, Nirman Kumar:
Robust Proximity Search for Balls using Sublinear Space. CoRR abs/1401.1472 (2014) - [i5]Sariel Har-Peled, Nirman Kumar, David M. Mount, Benjamin Raichel:
Space Exploration via Proximity Search. CoRR abs/1412.1398 (2014) - 2013
- [j1]Sariel Har-Peled
Approximate Nearest Neighbor Search for Low-Dimensional Queries. SIAM J. Comput. 42(1): 138-159 (2013) - [c6]Nirman Kumar, Benjamin Raichel:
Fault Tolerant Clustering Revisited. CCCG 2013 - [c5]Sariel Har-Peled
Approximating Minimization Diagrams and Generalized Proximity Search. FOCS 2013: 717-726 - [i4]Sariel Har-Peled, Nirman Kumar:
Approximating Minimization Diagrams and Generalized Proximity Search. CoRR abs/1304.0393 (2013) - [i3]Nirman Kumar, Benjamin Raichel:
Fault Tolerant Clustering Revisited. CoRR abs/1307.2520 (2013) - 2012
- [c4]Sariel Har-Peled
Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space. FOCS 2012: 430-439 - 2011
- [c3]Sariel Har-Peled
Approximate Nearest Neighbor Search for Low Dimensional Queries. SODA 2011: 854-867 - [i2]Sariel Har-Peled, Nirman Kumar:
Down the Rabbit Hole: Robust Proximity Search in Sublinear Space. CoRR abs/1111.2942 (2011) - 2010
- [i1]Sariel Har-Peled, Nirman Kumar:
Approximate Nearest Neighbor Search for Low Dimensional Queries. CoRR abs/1007.3296 (2010)
2000 – 2009
- 2005
- [c2]Nirman Kumar, Viraj Kumar
On the Complexity of Error Explanation. VMCAI 2005: 448-464 - 2003
- [c1]Nirman Kumar, Koushik Sen, José Meseguer, Gul Agha:
A Rewriting Based Model for Probabilistic Distributed Object Systems. FMOODS 2003: 32-46
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-05-08 21:04 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: