#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2010

2017

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

Given a universe U := U1]· · ·]Ur, and a r-uniform family F ⊆ U1×· · ·×Ur, 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)

Data pre-processing is an important and critical step in the data mining process and it has a huge impact on the success of a data mining project.[1](3) Data pre-processing is a step of the Knowledge discovery in databases (KDD) process that reduces the complexity of the data and offers better conditions to subsequent analysis. Through this the nature of… (More)

- Vikas Deep Goyal, Prachi Goyal, Monica Gupta
- Journal of clinical and diagnostic research…
- 2014

A trichobezoar is a mass of culminated hair within the gastrointestinal tract. Stomach is the common site of occurrence. Intestinal obstruction due to primary trichobezoar is extremely rare. Only few cases have been reported so far. We also present a case of 13-year-old girl having primary ileal trichobezoar causing intestinal obstruction.

- 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)

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 {r1 ≥ · · · ≥ rk}, 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 α · ri around the ith center covers all… (More)

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

- Prachi Goyal, Inder Kumar Pandit, Neeraj Gugnani, Monica Gupta, Richa Goel, Ramandeep Singh Gambhir
- European journal of dentistry
- 2016

OBJECTIVE
To evaluate and compare the efficacy of ferric sulfate, glutaraldehyde, and mineral trioxide aggregate (MTA) as pulpotomy medicaments in primary molars.
MATERIALS AND METHODS
This was a perspective randomized clinical trial. A total of 90 molars from 42 children aged 4-8 years were selected for pulpotomy procedure. Teeth were randomly divided… (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
- 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)