#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2013

2017

- This year (1)
- Last 5 years (10)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Prachi Goyal, Neeldhara Misra, Fahad Panolan
- FSTTCS
- 2013

Given a universe U := U 1 · · ·U r , and a r-uniform family F ⊆ U 1 ×· · ·×U r , the r-dimensional matching problem asks if F admits a collection of k mutually disjoint sets. The special case when r = 3 is the classic 3D-Matching problem. Recently, several improvements have been suggested for these (and closely related) problems in the setting of randomized… (More)

- Anuradha Patra, Divakar Singh, +14 authors Anitha quotEvaluating
- 2013

With the rapid growth of online information there is growing need for tools that help in finding filtering and managing the high dimensional data. text classification is a supervised learning task whose goal is to classify document into the predefined categories. Phases involved in text classification are collecting data set, preprocessing, stemming, and… (More)

In this paper, we introduce and study the Non-Uniform k-Center (NUkC) problem. Given a finite metric space (X, d) and a collection of balls of radii {r 1 ≥ · · · ≥ r k }, the NUkC problem is to find a placement of their centers on the metric space and find the minimum dilation α, such that the union of balls of radius α · r i around the ith center covers… (More)

- Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
- FSTTCS
- 2015

Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k edges (arcs) whose deletion results in a graph that satisfies some specified parity constraints. In particular, when the objective is to… (More)

- Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi
- SIAM J. Discrete Math.
- 2015

- Palash Dey, Prachi Goyal, Neeldhara Misra
- FUN
- 2014

This work is a follow up to [2, FUN 2010], which initiated a detailed analysis of the popular game of UNO R. We consider the solitaire version of the game, which was shown to be NP-complete. In [2], the authors also demonstrate a n O(c 2) algorithm, where c is the number of colors across all the cards, which implies, in particular that the problem is… (More)

The fundamental step of moving object in any image is visualize in different vision-systems including automated visual surveillance and conventional systems. Mostly in India, traffic system related to small geographic areas are more complex to handle. So our objective is to control the congestions and monitor the traffic activities by detecting the vehicle… (More)

- Prachi Goyal, Akshay Mehta, Jasbinder Kaur, Suksham Jain, Vishal Guglani, Deepak Chawla
- The journal of maternal-fetal & neonatal medicine…
- 2017

OBJECTIVE
To evaluate the efficacy of oral or intravenous fluid supplementation in accelerating the decline of serum bilirubin with intensive phototherapy among healthy term and late preterm neonates with hyperbilirubinemia.
STUDY DESIGN
This open-label randomized controlled trial randomized neonates with severe hyperbilirubinemia (serum total bilirubin… (More)

- Prachi Goyal, Vikram Kamat, Neeldhara Misra
- ArXiv
- 2013

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q ≥ 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q… (More)

- Prachi Goyal, Vikram Kamat, Neeldhara Misra
- MFCS
- 2013

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q… (More)

- ‹
- 1
- ›