- Full text PDF available (6)
- This year (0)
- Last 5 years (8)
- Last 10 years (10)
Journals and Conferences
The Clique Problem has a reduction to the Maximum Flow Network Interdiction Problem. We review the reduction to evolve a polynomial time algorithm for the Clique Problem. A computer program in C language has been written to validate the easiness of the algorithm. key words Polynomial time algorithm, Reduction, Maximum Flow Network Interdiction Problem.
Two metacercariae of Haplorchoides, recorded in the fingerlings of over a dozen species of freshwater fishes, are described and illustrated. Ovigerous flukes were recovered from older specimens of two species of fishes procured from the same locality. Comparison of taxonomic characters of the juveniles and adults suggests that they are conspecific. The… (More)
BACKGROUND Women make up more than 50% of adults living with human immunodeficiency virus (HIV) infection or the acquired immunodeficiency syndrome (AIDS) in sub-Saharan Africa. Thus, female-initiated HIV prevention methods are urgently needed. METHODS We performed a randomized, double-blind, placebo-controlled trial of cellulose sulfate, an HIV-entry… (More)
OBJECTIVE The aim of this study was to investigate the use of complementary and alternative medicines (CAMs) therapy by UK healthcare professionals involved in the care of pregnant women, and to identify key predictors of use. DESIGN A prospective survey. SETTING Maternity services in Grampian, North East Scotland. SAMPLE All healthcare professionals… (More)
In the present work an innovative attempt is being made to develop a novel conflation method that exploits the phonetic quality of words and uses some standard NLP tools like LD (Levenshtein Distance) and LCS (Longest Common Subsequence) for Stemming process. General Terms Information Retrieval (IR), Stemming.
A language independent stemmer has always been looked for. Single N-gram tokenization technique works well, however, it often generates stems that start with intermediate characters, rather than initial ones. We present a novel technique that takes the concept of N-gram stemming one step ahead and compare our method with an established algorithm in the… (More)