2 citations · 3 across the 7 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.IR2013
Suffix Stripping Problem as an Optimization Problem
B. P. Pande, Pawan Tamta, H. S. Dhami
Stemming or suffix stripping, an important part of the modern Information Retrieval systems, is to find the root word (stem) out of a given cluster of words. Existing algorithms ta…
math.OC2013
Cardinality Maximum Flow Network Interdiction Problem Vs. The Clique Problem
Pawan Tamta, Bhagwati Prasad Pande, H. S. Dhami
Cardinality Maximum Flow Network Interdiction Problem (CMFNIP) is known to be strongly NP-hard problem in the literature. A particular case of CMFNIP has been shown to have reducti…