22 citations · 50 across the 8 of their papers we have counts for
10 papers
Red blue -center clustering with distance constraints
M. Eskandari, B. B. Khare, N. Kumar
We consider a variant of the -center clustering problem in , where the centers can be divided into two subsets, one, the red centers of size , and the other, the blue…
Separated Red Blue Center Clustering
Marzieh Eskandari, Bhavika B. Khare, Nirman Kumar
We study a generalization of -center clustering, first introduced by Kavand et. al., where instead of one set of centers, we have two types of centers, red and blue, and…
CIDMP: Completely Interpretable Detection of Malaria Parasite in Red Blood Cells using Lower-dimensional Feature Space
Anik Khan, Kishor Datta Gupta, Deepak Venugopal +1
Predicting if red blood cells (RBC) are infected with the malaria parasite is an important problem in Pathology. Recently, supervised machine learning approaches have been used for…
Efficient Algorithms for k-Regret Minimizing Sets
Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos +1
A regret minimizing set Q is a small size representation of a much larger database P so that user queries executed on Q return answers whose scores are not much worse than those on…
Space Exploration via Proximity Search
Sariel Har-Peled, Nirman Kumar, David M. Mount +1
We investigate what computational tasks can be performed on a point set in , if we are only given black-box access to it via nearest-neighbor search. This is a reasonable as…
Robust Proximity Search for Balls using Sublinear Space
Sariel Har-Peled, Nirman Kumar
Given a set of n disjoint balls b1, . . ., bn in IRd, we provide a data structure, of near linear size, that can answer (1 \pm ε)-approximate kth-nearest neighbor queries in O(log…